radix sort Binary search in java Binary search in C

Bubble sort algorithm implementation in java:

Bubble sort algorithm implementation in java

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items, and swapping them if they are in the wrong order. The pass of the list is repeated until no swaps are needed, which indicates that the list is sorted.

The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. Although the algorithm is simple, most of the other sorting algorithms are more efficient for large lists.

Here is the Java code of Bubble Sort:

//http://programminghelpbd.blogspot.com/ import java.util.Scanner; class BubbleSort { public static void main(String []args) { int n, m, d, p; Scanner in = new Scanner(System.in); System.out.println("Input number of integers to sort: "); n = in.nextInt(); int array[] = new int[n]; System.out.println("Enter " + n + " integers"); for (m = 0; m < n; m++) array[m] = in.nextInt(); for (m = 0; m < ( n - 1 ); m++) { for (d = 0; d < n - m - 1; d++) { if (array[d] > array[d+1]) { p = array[d]; array[d] = array[d+1]; array[d+1] = p; } } } System.out.println("Sorted numbers: "); for (m = 0; m < n; m++) System.out.println(array[m]); } }

 Happy Coding...

You may also like to see:

bucket sort                                               Quick sort                                           bubble sort  

radix sort                                                 Binary search in java                         Binary search  in C