二分法

方法一：递归法

int binary_Search(vector<int> vt,int left,int right,int key){
    if(left>right) { return -1;}
    int mid = (left+right)/2;
    if(key == vt[mid])
        return mid;
    else if(key<vt[mid])
    {
        right = mid -1;
        return binary_Search(vt,left,right,key);
    }
    else
    {
        left = mid +1;
        return binary_Search(vt,left,right,key);
    }
}

方法二：非递归方法

int binary_Search(vector<int> vt,int key){
    int left = 0;
    int right = vt.size() - 1;
    while(left<=right)
    {
        int mid = (right+left)/2;
        if(key == vt[mid])
        {
             return mid;
        }
        else if(key>vt[mid])
        {
            left = mid + 1;
        }
        else{
            right = mid - 1;
        }
    }
    return -1;
}
···