【菜鸟er】搜索专题_二分搜索模板

#include <bits/stdc++.h>
using namespace std;

template <typename T>
bool er_search(T a[],T n,T num)
{
    int left = 0, right = n;
    int mid;
    while(left < right){
        mid = (left+right) / 2;
        if( num == a[mid] ) return true;
        else if( num > a[mid] ) left = mid + 1;
        else if( num < a[mid] ) right = mid;
    }
    return false;
}

int main()
{
    int n;
    int a[17]={69,45,8,2,9,1,3,7,6,956,94,296,785,12,58,894,56};
    n = 17;
    int num = 69;

    sort(a,a+n);

    int k = er_search(a,n,num);

    if(k == n)
        cout<<"NO"<<endl;
    else
        cout<<"YES"<<endl;


    return 0;
}