拆半搜索binary_search

//binary_search用于在有序的区间用拆半查找搜索等于某值得元素
#include<algorithm>
#include<iostream>

using namespace std;

int main()
{
    int a[] = {3, 9, 17, 22, 23, 24};

    const int len = sizeof(a)/sizeof(int);

    if(binary_search(a, a+len, 24))
        cout<<"数组包含24"<<endl;
    else
        cout<<"数组不包含24"<<endl;

    system("pause");

    return 0;
}