插入排序

package coding;

public class cha04_insertSort {
static final int SIZE=20;
public static void  insertSort(int [] a){
int i,j,t,h;
for(i=1;i<a.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+"步排序的结果是：");
for(h=0;h<a.length;h++){
System.out.print(" "+a[h]);
}
System.out.println();
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int [] shuzu=new int[SIZE];
int i;
for(i=0;i<SIZE;i++){
shuzu[i]=(int)(100+Math.random()*(100+1));
}
System.out.print("排序前的数组：");
for(i=0;i<SIZE;i++){

System.out.print(shuzu[i]+" ");
}
System.out.println();
insertSort(shuzu);
System.out.print("排序后的数组为：");
for(i=0;i<SIZE;i++){
System.out.print(shuzu[i]+" ");
}
System.out.println();
}
}