二分查找思想

最新推荐文章于 2022-03-09 12:14:46 发布

weixin_34015336

最新推荐文章于 2022-03-09 12:14:46 发布

阅读量74

点赞数

原文链接：http://www.cnblogs.com/wangyumin/p/5323512.html

版权

递归方法

[cpp] view plaincopyprint?
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;
}

非递归方法

[cpp] view plaincopyprint?
int BinSearch(int Array[],int SizeOfArray,int key/*要找的值*/)
{
int low=0,high=SizeOfArray-1;
int mid;
while (low<=high)
{
mid = (low+high)/2;
if(key==Array[mid])
return mid;
if(key<Array[mid])
high=mid-1;
if(key>Array[mid])
low=mid+1;
}
return -1;
}

转载于:https://www.cnblogs.com/wangyumin/p/5323512.html