public class InsertionSort {
static final int SIZE=10;
public static void insertionSort(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;
}
}
}
网友评论