最小值最大值算法

#include <iostream>
#include <algorithm>
#include <deque>

using namespace std;

bool absLess(int elem1, int elem2) // 比较两个函数的绝对值，
{
	return abs(elem1) < abs(elem2);
}

int main()
{
	deque<int> ideq;
	ideq.insert(ideq.end(),-15);
	for (int i = 2; i <= 8; ++i)
		ideq.insert(ideq.end(), i);
	for (int i = -3; i <= 5; ++i)
		ideq.insert(ideq.end(), i);
	for (deque<int>::iterator iter = ideq.begin(); iter != ideq.end(); ++iter)
		cout << *iter << ' ';
	cout << endl;

	deque<int>::iterator result = min_element(ideq.begin(), ideq.end());
	cout << "最小值：" << *result << endl; // min_element是找最小值,返回值是一个迭代器，
	cout << "最大值：" << *max_element(ideq.begin(), ideq.end()) << endl; // max_element是最大值，

	cout << "绝对最小值：" << *min_element(ideq.begin(), ideq.end(), absLess) << endl;
	cout << "绝对最大值：" << *max_element(ideq.begin(), ideq.end(), absLess) << endl;

	return 0;
}