This tutorial gives you details about the bubble sort program in java, how it works, and code of the program and also output of the uses examples in this.

In this tutorial, you will know about the **Bubble sort** program, which is a simple sorting algorithm, and it works by repeatedly stepping through the list to be sorted also comparing each pair of adjacent items.

During the process, the bubble sort algorithm array is reached from 0 to the length-1 index of the array. It also compared one element to the next element and also in swap values.

The bubble-sorting algorithm differentiates tow values and put the biggest values at largest index. The process follows the same steps unless the values of array are sorted out.

**Details about the Code Description**

During the process, the algorithm gets its name from the way smaller elements bubble to the top of the list. As it only uses comparisons to operate on elements, hence it is a comparison sort and you can see the code implementation. Thus Bubble Sorting is an algorithm in which we are comparing first two values and put the larger one at higher index. Again we take next two values compare these values and place larger value at higher index. The continue process proceeds iteratively until the largest value is not reached at last index and start again from zero index up to n-1 index. The algorithm follows the same steps iteratively unlit elements are not sorted.

Working of bubble sort algorithm:

Say we have an array unsorted A[0],A[1],A[2]................ A[n-1] and A[n] as input. Then the following steps are followed by bubble sort algorithm to sort the values of an array.

1.Compare A[0] and A[1] .

2.If A[0]>A[1] then Swap A[0] and A[1].

3.Take next A[1] and A[2].

4.Comapre these values.

5.If A[1]>A[2] then swap A[1] and A[2]

...............................................................

................................................................

at last compare A[n-1] and A[n]. If A[n-1]>A[n] then swap A[n-1] and A[n]. As we see the highest value is reached at nth position. At next iteration leave nth value. Then apply the same steps repeatedly on A[0],A[1],A[2]................ A[n-1] elements repeatedly until the values of array is sorted.

In our example we are taking the following array values

12 9 4 99 120 1 3 10

The basic steps followed by algorithm:-

In the first step compare first two values 12 and 9.

12 9 4 99 120 1 3 10

As 12>9 then we have to swap these values

Then the new sequence will be

9 12 4 99 120 1 3 10

In next step take next two values 12 and 4

9 12 4 99 120 1 3 10

Compare these two values .As 12>4 then we have to swap these values.

Then the new sequence will be

9 4 12 99 120 1 3 10

We have to follow similar steps up to end of array. e.g.

9 4 12 99 120 1 3 10

9 4 12 99 120 1 3 10

9 4 12 99 1 120 3 10

9 4 12 99 1 120 3 10

9 4 12 99 1 3 120 10

9 4 12 99 1 3 10 120

When we reached at last index .Then restart same steps unlit the data is not sorted.

The output of this example will be :

1 3 4 9 10 12 99 120

**The code of the program:**

public class bubbleSort{ public static void main(String a[]){ int i; int array[] = {12,9,4,99,120,1,3,10}; System.out.println("Values Before the sort:\n"); for(i = 0; i < array.length; i++) System.out.print( array[i]+" "); System.out.println(); bubble_srt(array, array.length); System.out.print("Values after the sort:\n"); for(i = 0; i < array.length; i++) System.out.print(array[i]+" "); System.out.println(); System.out.println("PAUSE"); } public static void bubble_srt( int a[], int n ){ int i, j,t=0; for(i = 0; i < n; i++){ for(j = 1; j < (n-i); j++){ if(a[j-1] > a[j]){ t = a[j-1]; a[j-1]=a[j]; a[j]=t; } } } } }

**Output of the example:**

C:\array\sorting>javac bubbleSort.java

C:\array\sorting>java bubbleSort

Values Before the sort:

12 9 4 99 120 1 3 10

Values after the sort:

1 3 4 9 10 12 99 120

PAUSE

C:\array\sorting>_

Ads