PackageCom.cn.gao;//Insert Sort Reverse order Public classInsertionsort { Public Static Final intsize=10; //Insert sort reverse order algorithm Public Static voidInsertionsort (intA[],intN) { inti,j,temp; for(i=1;i<n;i++) {Temp=A[i]; for(j=i-1;j>=0;j--){ if(a[j]<temp) {A[j+1]=A[j]; }Else{ Break; }} a[j+1]=temp; System.out.print (The result of the "+i+" Order is: "); for(j=0;j<n;j++) {System.out.print (" "+A[j]); } System.out.println (); } } Public Static voidMain (string[] args) {int[] A =New int[SIZE]; //assigning values to arrays for(inti=0;i<a.length;i++) {A[i]= (int) (+ + math.random () *100); } //array before the output is sortedSYSTEM.OUT.PRINTLN ("Array before sorting is:"); for(inti=0;i<a.length;i++) {System.out.print (A[i]+" "); } System.out.println (); //sort an arrayInsertionsort (a,size); //output sorted ArraySystem.out.println ("Sorted array is:"); for(inti=0;i<a.length;i++) {System.out.print (A[i]+" "); } System.out.println (); }}
Insert Sort Reverse Order