#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int number[10];
for (int i = 0; i < 10; i++)
number[i] = i * 2;
//返回值为bool类型
if (binary_search(number, number+10, 2))
cout << "Found!\n";
else
cout << "Not Found!\n";
int *numPtr = find(number, number+10, 2);//返回值类型为迭代器或者指针
if (numPtr != NULL)
cout << "Found!\n";
else
cout << "Not Found!\n";
cin.get();
return 0;
}