Java Algorithm Bubble Sorting

Code:

 

Package COM. xu. main; public class p10_1 {static final int size = 10; public static void bubblesort (int A []) {int temp; For (INT I = 1; I <. length; I ++) {for (Int J = 0; j <. length-I; j ++) {if (a [J]> A [J + 1]) // compare two adjacent numbers, A large number of values bubble back {// swap two adjacent numbers temp = A [J]; A [J] = A [J + 1]; A [J + 1] = temp;} system. out. println ("+ I +" Step sorting result: "); For (int K = 0; k <. length; k ++) {system. out. print ("" + A [k]);} system. out. println () ;}} public static void main (string [] ARGs) {int [] shuzu = new int [size]; int I; for (I = 0; I <size; I ++) {shuzu [I] = (INT) (100 + math. random () * (100 + 1);} system. out. println ("array before sorting:"); for (I = 0; I <size; I ++) {system. out. print (shuzu [I] + "");} system. out. println (); bubblesort (shuzu); system. out. println ("sorted array:"); for (I = 0; I <size; I ++) {system. out. print (shuzu [I] + "");} system. out. println ();}}

 
Running result: