折半插入排序

#include<stdio.h>

void Bisort(int a[],int n)
{
    int low,high,mid;
    for(int i=2; i<=n; i++)
    {
        int x=a[i];
        low=1,high=i-1;
        while(low<=high)
        {
            mid=(low+high)/2;
            if(x<a[mid])
                high=mid-1;
            else
                low=mid+1;
        }
        for(int j=i-1;j>=high+1; j--)
            a[j+1]=a[j];
        a[high+1]=x;
    }
}
int main()
{
    int a[100],n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    Bisort(a,n);
    for(int i=1; i<=n; i++)
        printf("%d ",a[i]);
    printf("\n");
    return 0;
}