C++语言习题 折半查找

#include <iostream>#include <cmath>using namespace std;void input(int a[],int n){    int i;    for(i=0;i<n;i++)    {        cin>>a[i];    }}int binsearch(int a[],int n,int value){    int low=0,high=n-1,m=0;    while(low<=high)    {        int mid=(low+high)/2;        if(value==a[mid])        {            m=mid+1;            break;        }        else if(a[mid]<value)            high=mid-1;        else            low=mid+1;    }    return m;}int main(){    int a[20],n=0,value;    int position;    cin>>n;    input(a,n);    cin>>value;    position=binsearch(a,n,value);    cout<<position;    return 0;}

输出结果：