Java Implementation bubble sort

Bubble sort

Basic idea: In the group of numbers to be sorted, the total number of unsorted in the current range, the top-down pair of adjacent two numbers sequentially
Compare and adjust, let the larger number go down, the smaller go up.

 Public classbubblesort{ Public Static voidMain (string[] args) {int[] a={1,5,6,5,4,6,4,8}; inttemp = 0;//define where temporary variables are used to exchange data for(inti=0; I <a.length-1; i++{//Outer loop indicates the number of wheels to sort is a.length-1 wheel for(intj=0; j<a.length-1-i; J + +{//loop to compare adjacent numeric sizesif(A[j] > a[j+1] {//To swap large numbers with small numbers, large numbers to sink, decimals to run temp=A[j]; A[J]= A[j+1]; A[j+1] =temp; }            }        }         for(inti=0; i < a.length; i++{//PrintOut results System.out.println (a[i]); }    }}

Java Implementation bubble sort