This is a java program to sort the numbers using the Bubble Sort Technique. The algorithm goes with the name, generally used to sort numbers in the ascending order. The smallest numbers bubbles up at each iteration of the sort. The time complexity of the algorithm is O(n^2).
Here is the source code of the Java Program to Implement Bubble Sort. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to sort numbers using bubble sort
import java.util.Random;
public class Bubble_Sort
{
static int[] sort(int[] sequence)
{
// Bubble Sort
for (int i = 0; i < sequence.length; i++)
for (int j = 0; j < sequence.length - 1; j++)
if (sequence[j] > sequence[j + 1])
{
sequence[j] = sequence[j] + sequence[j + 1];
sequence[j + 1] = sequence[j] - sequence[j + 1];
sequence[j] = sequence[j] - sequence[j + 1];
}
return sequence;
}
static void printSequence(int[] sorted_sequence)
{
for (int i = 0; i < sorted_sequence.length; i++)
System.out.print(sorted_sequence[i] + " ");
}
public static void main(String args[])
{
System.out
.println("Sorting of randomly generated numbers using BUBBLE SORT");
Random random = new Random();
int N = 20;
int[] sequence = new int[N];
for (int i = 0; i < N; i++)
sequence[i] = Math.abs(random.nextInt(1000));
System.out.println("\nOriginal Sequence: ");
printSequence(sequence);
System.out.println("\nSorted Sequence: ");
printSequence(sort(sequence));
}
}
Output:
$ javac Binary_Counting_Subsets.java $ java Binary_Counting_Subsets $ javac Bubble_Sort.java $ java Bubble_Sort Sorting of randomly generated numbers using BUBBLE SORT Original Sequence: 307 677 574 88 325 851 676 357 172 932 166 450 60 538 964 987 706 690 919 518 Sorted Sequence: 60 88 166 172 307 325 357 450 518 538 574 676 677 690 706 851 919 932 964 987
Related posts:
Supplier trong Java 8
Spring REST API with Protocol Buffers
HashMap trong Java hoạt động như thế nào?
Sort a HashMap in Java
Map Serialization and Deserialization with Jackson
Join and Split Arrays and Collections in Java
Java Program to Implement Sieve Of Sundaram
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
Adding a Newline Character to a String in Java
Java Program to Implement VList
Guide to java.util.concurrent.Future
Java Program to Perform Partial Key Search in a K-D Tree
Java Program to Implement Hamiltonian Cycle Algorithm
Java – Byte Array to Reader
Luồng Daemon (Daemon Thread) trong Java
Java Program to Implement Levenshtein Distance Computing Algorithm
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Quick Intro to Spring Cloud Configuration
Java Program to Implement Hash Tables with Double Hashing
A Guide to Java 9 Modularity
Introduction to PCollections
Java Program to Check Cycle in a Graph using Topological Sort
Java Program to Check Whether it is Weakly Connected or Strongly Connected for a Directed Graph
Java Program to implement Array Deque
Java Program to Implement CopyOnWriteArrayList API
Guide to the Fork/Join Framework in Java
Java Program to Implement LinkedBlockingDeque API
REST Pagination in Spring
Java Program to Implement Stack API
Spring Security OAuth Login with WebFlux
Java Program to Implement Gauss Jordan Elimination
OAuth2.0 and Dynamic Client Registration