二分插入排序和二分查找

#include <iostream>

//二分插入排序
void BInsertSort(int *a,int c)
{
for(int i=1;i<c;i++)
{
int key=a[i];
int left=0,right=i-1;
while(left<=right)
{
int middle=(left+right)/2;
if(key>a[middle])
left=middle+1;
else
right=middle-1;
}
//此时left所在位置为要插入的位置
for(int j=i;j>left;j--)
a[j]=a[j-1];
a[left]=key;
}
}

//二分查找
int BSearch(int *a,int tar,int length)
{
int left=0,right=length-1,middle;
while(left<=right)
{
middle=(left+right)/2;
if(tar>a[middle])
left=middle+1;
else if(tar<a[middle])
right=middle-1;
else
return middle;
}
return -1;
}

int main()
{
int a[10]={9,4,10,5,8,7,3,6,1,2};
int c=10;
BInsertSort(a,c);
for(int i=0;i<c;i++)
{
printf("%d\n",a[i]);
}
int b=BSearch(a,9,c);
printf("%d\n",b);
return 0;
}