binary_seach二分查找

#include<iostream>
using namespace std;
#include<deque>
#include<algorithm>
void test01()
{
	//二分查找
	deque<int> m = { 1,2,3,4,5 };
	bool ret=binary_search(m.begin(), m.end(), 10);
	if (ret)
	{
		cout << "查到该元素" << endl;
	}
	else
	{
		cout << "查不到该元素" << endl;
	}
}
int main()
{
	test01();
	system("pause");
	return 0;
}