给出一组数据并进行排序，直接插入排序与折半插入排序示例

package javaproject;
public class ZhijiePaixu {    
    void insertSort(int a[])
    {
        int i,j,k;
        int n=a.length;
        for(i=1;i<n;i++)
        {
            for(j=i-1;j>=0;j--)
                if(a[j]<a[i])
                    break;
                if(j!=i-1)
                {
                    int temp=a[i];
                    for(k=i-1;k>j;k--)
                        a[k+1]=a[k];
                    a[k+1]=temp;
                }
        }
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int a[]={12,2,26,7,8,11};
        ZhijiePaixu b=new ZhijiePaixu();
        System.out.println("排序前："+a[0]+" "+a[1]+" "+a[2]+" "+a[3]+" "+a[4]+" "+a[5]);
        b.insertSort(a);
        System.out.println("排序后："+a[0]+" "+a[1]+" "+a[2]+" "+a[3]+" "+a[4]+" "+a[5]);
    }

}

package javaproject;

public class ZheBanPaixu {

    void insertSort(int a[])
    {
        int low,high,m,k;
        int n=a.length;
            for(int i=1;i<n;i++)
            {    low=0;high=n-1;
                while(low<=high)
                {
                    m=(low+high)/2;
                    if(a[m]<a[i])
                        low=m+1;
                    else
                        high=m-1;
                }
                if(high+1!=i-1)
                {
                    int temp=a[i];
                    for(k=i-1;k>high+1;k--)
                        a[k+1]=a[k];
                        a[k+1]=temp;
                }
            }
        }
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            int a[]={12,2,26,7,8,11};
            ZhijiePaixu b=new ZhijiePaixu();
            System.out.println("排序前："+a[0]+" "+a[1]+" "+a[2]+" "+a[3]+" "+a[4]+" "+a[5]);
            b.insertSort(a);
            System.out.println("排序后："+a[0]+" "+a[1]+" "+a[2]+" "+a[3]+" "+a[4]+" "+a[5]);
        }

    }