DS静态查找之折半查找

#include<iostream>
using namespace std;
int halfFind(int *array,int low,int high)
{
    while(low<=high)
    {
        int mid=(low+high)/2;
        if(array[0]==array[mid])
            return mid;
        else if(array[0]>array[mid])
            low=mid+1;
        else if(array[0]<array[mid])
            high=mid-1;
    }
    return 0;
}
 
int main()
{
    int n;
    cin>>n;
    int *array=new int[n+1];
    for(int i=1;i<=n;i++)
    {
        cin>>array[i];
    }
    int num;
    cin>>num;
    while(num--)
    {
        cin>>array[0];
        int result=halfFind(array,1,n);
        if(result!=0)
            cout<<result<<endl;
        else
            cout<<"error"<<endl;
    }
    delete []array;
    return 0;
}