折半查找

#include<stdio.h>
int BinSearch(int *arr,int len,int key)


{
int low = 0;
int high = len-1;
int mid;
while(low <= high)
{
mid = (low+high)>>1;//(low+high)/2
if(arr[mid] == key)
{
return mid;
}
else if(arr[mid] < key)//后半段查找
{
low = mid+1;
}
else
{
high = mid-1;
}
}


return -1;
}


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