Learn Java Java Tutoring is a resource blog on java focused mostly on beginners to learn Java in the simplest way without much effort you can access unlimited programs, interview questions, examples
Bubble Sort in Java – We will discuss the different methods to Implement Bubble Sort in 2 Simple ways. The compiler has been added so that you easily execute the programs yourself, alongside suitable examples and sample outputs added to implement bubble sort – List of all sorting Programs In Java
- Program – Using Array.
- Program – Using Buffered Reader.
Bubble Sort Java Algorithm – Using Array
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 |
import java.util.Scanner; public class BSort { public static void Sort(int a[]) { int n=a.length,i,j,p,temp; for (i = 0;i < n-1; i++) { for (j=0; j<n-i-1; j++) { if(a[j+1]<a[j]) {temp=a[j+1]; a[j+1]=a[j]; a[j]=temp;} } } } public static void printarray(int a[]) { for(int i=0; i < a.length; i++) { System.out.print(a[i]+" "); } } public static void main(String[] args) { int n, res,i; Scanner s = new Scanner(System.in); System.out.print("Enter number of elements in the array:"); n = s.nextInt(); int a[] = new int[n]; System.out.println("Enter "+n+" elements "); for( i=0; i < n; i++) { a[i] = s.nextInt(); } System.out.println( "elements in array "); printarray(a); Sort(a); System.out.println( "\nelements after sorting"); printarray(a); } } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 |
Enter number of elements in the array:5 Enter 5 elements 5 4 3 2 1 elements in array 5 4 3 2 1 elements after sorting 1 2 3 4 5 |
Explanation For Above Program:
1) For bubble sort, we are using array concept.
2) Printarray() method prints the array elements, sort() method will sort the array elements using bubble sort logic.
3) For each iteration of i, the inner loop compare the adjacent numbers and moves the large number towards the right and the large number will be placed in the proper position.
4) The given series is 5, 4, 3, 2, 1.
For the first iteration of i
a) The inner loop will compare 5,4. 5 is the large number compared with 4, so 5 shifted to the right. Now the series is 4, 5, 3, 2, 1.
b) Compare 5 with 3 and shift 5 to right. The series is 4, 3, 5, 2, 1.
c) Compare 5 with 2 and shift 5 to right. The series is 4, 3, 2, 5, 1.
d) Compare 5 with 1 and shift 5 to right. The series is 4, 3, 2, 1, 5.
After 1st iteration, 5 will be shifted to the last index. Now the series is 4, 3, 2, 1, 5.
For the 2nd iteration of i
a) The inner loop compares 4,3 and shift 4 to right. The series is 3, 4, 2, 1, 5.
b) Compare 4,2 and shift 4 to right, series is 3, 2, 4, 1, 5.
c) Compare 4,1 and shift 4 to right, series is 3, 2, 1, 4, 5.
For the 3rd iteration of i
a) The inner loop will compare 3,2 and shift the number 3 to right, series is 2, 3, 1, 4, 5.
b) Compare 3 with 1 ,shift 3 to right, series is 2, 1, 3, 4, 5.
For 4th iteration
a) Inner loop compares 2,1 and shifts 2 to right, the series is 1, 2, 3, 4, 5.
After all iterations, the sorted array is 1, 2, 3, 4, 5.
Bubble Sort Java – Using Buffered Reader
1) Buffered Reader reads the entered number as a string using readLine() method. Convert each element in to integer using Integer.parseInt().
2) printarray() prints the array elements, sort() method will sort the array elements using bubble sort logic.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
import java.util.Scanner; import java.io.*; public class BSort { public static void Sort(int a[]) { int n=a.length,i,j,p,temp; for (i = 0;i < n-1; i++) { for (j=0; j<n-i-1; j++) { if(a[j+1]<a[j]) {temp=a[j+1]; a[j+1]=a[j]; a[j]=temp;} } } } public static void printarray(int a[]) { for(int i=0; i < a.length; i++) { System.out.print(a[i]+" "); } } public static void main(String[] args) throws IOException { int n,i; BufferedReader b=new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter N: "); n=Integer.parseInt(b.readLine()); int a[] = new int[n]; System.out.println("enter "+n+" elements "); for(i= 0; i< n; i++) a[i] = Integer.parseInt(b.readLine()); System.out.println("elements in array "); printarray(a); Sort(a); System.out.println("\nelements after sorting"); printarray(a); } } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 12 |
enter N: 5 enter 5 elements 5 6 1 7 5 elements in array 5 6 1 7 5 elements after sorting 1 5 5 6 7 |
Fore More: List Of All Sorting Programs In Java Here
