元素的排序

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

using namespace std;
int main()
{
deque<int> ideq;
for (int i = 1; i <= 9; ++i)
ideq.push_back(i);
for (int i = 1; i <= 9; ++i)
ideq.push_back(i);

for (deque<int>::iterator iter = ideq.begin(); iter != ideq.end(); ++iter)
cout << *iter << ' ';
cout << endl;

sort(ideq.begin(), ideq.end());  // sort 是进行排序的，从小到大排序
for (deque<int>::iterator iter = ideq.begin(); iter != ideq.end(); ++iter)
cout << *iter << ' ';
cout << endl;

sort(ideq.begin(), ideq.end(), greater<int>());// 这个是从大到小的排序，
for (deque<int>::iterator iter = ideq.begin(); iter != ideq.end(); ++iter)
cout << *iter << ' ';
cout << endl;

return 0;
}