void binaryinsertionsort(int *arr, int n)
{
    int b;
    int c;
    int e;
    int i;
    int j;
    int k;
    double tmp;

    for(i = 2; i <= n; i++)
    {
        b = 1;
        e = i-1;
        c = (b+e)/2;
        while(b!=c)
        {
            if( arr(c-1)>arr(i-1) )
            {
                e = c;
            }
            else
            {
                b = c;
            }
            c = (b+e)/2;
        }
        if( arr(b-1)<arr(i-1) )
        {
            if( arr(i-1)>arr(e-1) )
            {
                b = e+1;
            }
            else
            {
                b = e;
            }
        }
        k = i;
        tmp = arr(i-1);
        while(k>b)
        {
            arr(k-1) = arr(k-1-1);
            k = k-1;
        }
        arr(b-1) = tmp;
    }
}