写search函数对已经排好的n个元素的整数数组a，查找整数key。

#include<iostream>
using namespace std;
int search(int a[],int low,int high,int n);
int main()
{
int i,low=0,high=9,key;
int a[10]={2,3,12,23,24,34,51,61,71,81};
cout<<"输出已排数组的值"<<endl;
for(i=0;i<10;i++)
cout<<a[i]<<" ";
cout<<endl;
cout<<"请输入要查找的值："<<endl;
cin>>key;
search(a,low,high,key);
return 0;
}
int search(int a[],int low,int high,int n)
{
int i;
i=(low+high)/2;
if((high<low)||(n>a[high]))
{
cout<<"找不到"<<endl;
return -1;
}
if(n==a[i])
{ cout<<"找到了"<<endl;
return 0;
}
if(n>a[i])
return search(a,i+1,high,n);
else
return search(a,low,i-1,n);
}

原文地址：https://www.cnblogs.com/chenzinumber1/p/8127923.html