33,311
社区成员
发帖
与我相关
我的任务
分享
//正确代码,参考自http://blog.csdn.net/q3498233/article/details/4419285
int BinSearch(int Array[],int low,int high,int key/*要找的值*/)
{
if (low<=high)
{
int mid = (low+high)/2;
if(key == Array[mid])
return mid;
else if(key<Array[mid])
return BinSearch(Array,low,mid-1,key);
else if(key>Array[mid])
return BinSearch(Array,mid+1,high,key);
}
else
return -1;
}
int main()
{
int array[]={1,2,3,4,5,6,7,8,9};
cout<<BinSearch(array,1,9,19)<<endl;
return 0;
}
else if(key<Array[mid])
return BinSearch(Array,low,mid,key);
else if(key>Array[mid])
return BinSearch(Array,mid,high,key);