java插入排序法

public class insertionSort {
    static void insertion(int a[]) {
        int j,t,h;
        for (int 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;
        }
    }

    public static void main(String args[]) {
        int[] a = new int[10];
        for (int i = 0; i < 10; i++) {
            a[i] = 100 - i;
        }
        insertion(a);
        for (int b : a) {
            System.out.print(b + " ");
        }
    }
}