二分搜索技术

#include <iostream>
using namespace std;

template <class Type>
int BinarySearch(Type a[],const Type &x,int n){
    int left=0;
    int right = n-1;
    while(left<=right){
        int middle = (left+right)/2;
        if(x == middle)
            return middle;
        if(x > a[middle])
            left = middle+1;
        else
            right = middle-1;
    }
    return -1;
}
int main()
{
    int num[10] = {0,9,8,7,6,5,4,3};
    int a;
    cout<<"输入想要查找的数字:"<<endl;
    cin>>a;
    int find = BinarySearch(num,a,9);
    if(find!=-1)
        cout<<find<<endl;
    else
        cout<<"找不到想要的结果"<<endl;
    return 0;
}