查找算法1

#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>

using namespace std;

int main()
{
	vector<int> ivec;
	vector<int>::iterator pos;

	for (int i = 1; i <= 9; ++i)
		ivec.push_back(i);
	for (vector<int>::iterator iter = ivec.begin(); iter != ivec.end(); ++iter)
		cout << *iter << ' ';
	cout << endl;
	//                                      谓词。
	pos = find_if(ivec.begin(), ivec.end(), bind2nd(greater<int>(), 3));  // 查找大于3的数，
	cout << *pos << endl;
	
	pos = find_if(ivec.begin(), ivec.end(), not1(bind2nd(modulus<int>(), 3)));  // modulus是取模运算，
	cout << *pos << endl;  // 查找第一个被3整除的数，


	return 0;
}