算法复习 （一）二分查找

测试程序
注意输入的数据要有顺序（从小到大）
@#include
using namespace std;
int search (int search_number,int number[],int high1){
int low=0;
int high=high1-1;
int t=0;
int guess=0;
while (low<=high){ //小于等于
t=(low+high)/2;
guess=number[t];
if(guess==search_number)
{
return t;
}
else if(guess>search_number)
{
high=t-1;
}
else
{
low=t+1;
}
}
return 0;
}
int main(){
int a[5];
int line=0;
for (int i=5;i<5;i++)
{
a[i]=i;
}
line=sizeof(a)/sizeof(a[0]);
int search1;
cin>>search1;
cout<<search(search1,a,5);
return 0;
}