//二分查找(补充)
//用迭代和递归分别描述
#include <iostream>
using namespace std;
int BinarySearch_I(int *list,const int x,const int n)//迭代
{
int left=0,right=n-1;
while(left<=right){
int middle=left+(right-left)/2;
if(x<list[middle])right=middle-1;
else if(x>list[middle])left=middle+1;
else return middle;
}
return -1;
}
int BinarySearch_R(int *list,const int x,const int left,const int right)//递归
{
if(left<=right){
int middle=left+(right-left)/2;
if(x<list[middle])
return BinarySearch_R(list,x,left,middle-1);
else if(x>list[middle])
return BinarySearch_R(list,x,middle+1,right);
else
return middle;
}
return -1;
}
int main()
{
int a[]={1,2,3,4,5,6,7,8,9,10};
int result_I,result_R,num=7;
result_I=BinarySearch_I(a,num,10);
result_R=BinarySearch_R(a,num,0,9);
if(result_I<0)cout<<"迭代算法:没有找到"<<endl;
else cout<<"迭代算法:在a["<< result_I<<"]找到"<<num<<endl;
if(result_R<0)cout<<"递归算法:没有找到"<<endl;
else cout<<"递归算法:在a["<< result_R<<"]找到"<<num<<endl;
return 0;
}