public class InsertSort {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        //插入排序
        int a[]={10,12,14,15,9,4,1};
        for (int k = 0; k < a.length; k++) {
            for (int k2=k; k2>0&&a[k2-1]>a[k2];k2--) {
            int temp=a[k2];
            a[k2]=a[k2-1
 
];
            a[k2-1]=temp;
                }
            }
        System.out.println("排序後結果");
        for (int k2 = 0; k2 < a.length; k2++) {
            System.out.print(a[k2]+" ");            
        }            
    }

}