问题描述:
代码如下:
int BinSearch(int x,int *arr,int len)
{
int low = 0; /* 下标的最小值 */
int high = len-1; /* 下标的最大值 */
int mid; /* 下标的折半值 */
while(low<=high)
{
mid = (low+high)/2;
if(x==arr[mid])
{
return mid;
}
else if(x<arr[mid])
{
low = mid+1;
}
else
{
high = mid-1;
}
}
return -1;
}