Java sorting algorithm: bubbling sort

Java sorting algorithm: bubbling sort

        //Create an array and assign a value         int[]  data = new int[] {11,10,55,78,100,111,45,56,79,90,345,1000};         for (int i=0;i < arr.length-1;i++) {             for (int j =0; j < arr.length-i-1;j++) {                 if (Arr[j] &NBSP;&GT;&NBSP;ARR[J+1]) {                     int temp = arr[j];                     arr[j] = arr[j+1 ];                     arr[j+1] = temp;                }             }         }    //Output Print     public static void output ( Int[] arr) {        for (int i=0;i<arr.length;i++) {                 system.out.print (arr [i]+ "\ t");             }

The results are as follows:

Bubble sort Algorithm implementation process:

1. Use double loops for 22 comparison sorting

2. If the number behind is greater than the previous number, the swap position

3. Traverse the entire array and complete the sorting after 11 cycles

Java sorting algorithm: bubbling sort