折半插入查找

//折半插入排序
#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 100
void BinartInsertSort(int a[MAX],int n)
{
int low,high,mid;
for(int i=2;i<=n;i++)
{
low=1;
high=i-1;
a[0]=a[i];
while(low<=high)
{
mid=(low+high)/2;
if(a[mid]>a[0]) high=mid-1;
else low=mid+1;
}
for(int j=i-1;j>=high+1;j--)
a[j+1]=a[j];
a[high+1]=a[0];
}
}
int main()
{
int a[MAX];
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
BinartInsertSort(a,n);
for(int i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}