示例:
#include<iostream>
using namespace std;
#include<deque>
#include<algorithm>
void printDeque(const deque<int> &d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
deque<int>d;
d.push_back(10);
d.push_back(20);
d.push_back(30);
d.push_front(100);
d.push_front(200);
d.push_front(300);
cout << "排序前" << endl;
printDeque(d);
cout << "排序后" << endl;
sort(d.begin(), d.end());//默认为升序排序,vector容器也可以使用sort排序
printDeque(d);
}
int main()
{
test01();
return 0;
}
总结:
sort算法非常实用,使用时包含头文件 algorithm 即可