C++ STL 算法：区间的比较

1、equal(b,e,b2)

if(equal(ivec.begin(),ivec.end(),ilist.begin()))
	cout << "这两个区间相等" << endl;
else
	cout << "这两个区间不相等" << endl;

2、equal(b,e,b2,p)

bool bothEvenOrOdd(int elem1, int elem2)
{
	return elem1 % 2 == elem2 % 2;
}
if(equal(ivec.begin(),ivec.end(),ilist.begin(),bothEvenOrOdd))
{
	cout << "这两个区间是奇数对应奇数，偶数对应偶数" << endl;
}
else
{
	cout << "这两个区间不是奇数对应奇数，偶数对应偶数" << endl;
}

3、mismatch(b,e,b2)

pair<vector<int>::iterator,list<int>::iterator> values;
values = mismatch(ivec.begin(),ivec.end(),ilist.begin());
if(values.first == ivec.end())
{
	cout << "没有找到不相等的数: no mismatch" << endl;
}
else
{
	cout << "first mismatch: " << *values.first << " and " << *values.second << endl;
}

4、mismatch(b,e,b2,p)

values = mismatch(ivec.begin(),ivec.end(),ilist.begin(),less_equal<int>());
if(values.first == ivec.end())
	cout << "没找到! (always less-or-equal)" << endl;
else
	cout << "找到了(not less-or-equal): " << *values.first << ", " << *values.second << endl; 
return 0;

5、lexicographical_compare(b,e,b2,e2)

if(lexicographical_compare(c4.begin(),c4.end(),c1.begin(),c1.end()))
	cout << "c4小于c1" << endl;
else
	cout << "c4大于等于c1" << endl;

6、lexicographical_compare(b,e,b2,e2,p)

用于按字典序比较两个序列，如果前者小于后者返回true，否则返回false。

7、sort中使用lexicographical_compare

bool lessForCollection(const list<int>& list1, const list<int>& list2)
{
	return lexicographical_compare(list1.begin(), list1.end(), list2.begin(), list2.end());
}
sort(cc.begin(), cc.end(), lessForCollection);