倒序插入排序算法
public class p4_8 {
static final int SIZE = 10;
static void insertionSort(int[] a,int len){
int i,j,t,h;
for(i = 1;i<len;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.println("第"+i+"步排序结果:");
for(h=0;h<len;h++){
System.out.print(" "+a[h]);
}
System.out.println();
}
}
public static void main(String[] args) {
int[] shuzu = new int[SIZE];
for (int i = 0; i < SIZE; i++) {
shuzu[i] = (int)(100 + Math.random()*(100+1));
}
System.out.println("排序前数组为:");
System.out.println("begin time"+ new Date());
System.out.println();
insertionSort(shuzu,SIZE);
System.out.println("排序后数组为:");
System.out.println("end time"+ new Date());
}