Java simple insertion Sorting Algorithm

Public class insertsort {static final int size = 10; static void insertionsort (INT [] A) // Insert the sorting {int I, j, T, H; for (I = 1; I <. length; I ++) {T = A [I]; j = I-1; while (j> = 0 & T <A [J]) {A [J + 1] = A [J]; j --;} A [J + 1] = T; system. out. print ("+ I +" Step sorting result: "); // output the result of each step sorting for (H = 0; H <. length; H ++) {system. out. print ("" + A [H]); // output} system. out. print ("\ n") ;}} 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); // initialize the array} system. out. print ("the array before sorting is \ n"); // output the array before sorting for (I = 0; I <size; I ++) {system. out. print (shuzu [I] + "");} system. out. print ("\ n"); insertionsort (shuzu); // sort system. out. print ("the sorted array is \ n"); for (I = 0; I <size; I ++) {system. out. print (shuzu [I] + ""); // output the sorted array} system. out. print ("\ n ");}}