#include <stdio.h>

void halfInsertSort(int a[],int n);

int main()
{
    int a[] = {0,1,2,3,4,6,7,8,9,10,5};
    int k = 0;
    halfInsertSort(a,10);
    for(k=1;k<=10;k++)
    {
        printf("%4d",a[k]);
    }
    return 0;
}

void halfInsertSort(int a[],int n)
{
    int low,mid,high;
    int i,j,m;
    for(i=2;i<=n;i++)
    {
        a[0] = a[i];
        low = 1;
        high = i -1;
        while(low<=high)
        {
            m = (low+high)/2;
            if(a[0]<a[m])
            {
                high = m -1;
            }else low = m + 1;
        }
        for(j=i-1;j>=high;j--)
        {
            a[j+1] = a[j];
        }
        a[high+1] = a[0];
    }
}