Sorting issues (bubbling sort)

   /* Basic ideas: 22 Compare the size of the data elements to be sorted, and find that two data elements are   exchanged in reverse order until there are no reversed data elements.          */static void Bubble_sort (int[] a) {  //bubble sort from small to large sort for     (int. i=0;i<a.length-1;i++) {for (int       j=0;j <a.length-1-i;j++) {//from lowest bubbling to highest        if (A[j]>a[j+1]) {          a[j]=a[j]^a[j+1];  Using the value of XOR A[j] and a[j+1]          ; a[j+1]=a[j]^a[j+1];           A[J]=A[J]^A[J+1];}}}    

Sorting issues (bubbling sort)