C++deque容器deque 排序
功能描述：
#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
//利用算法实现对deque容器进行排序
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); ++it)
{
cout << *it << " ";
}
cout << endl;
}
void test()
{
deque<int> d;
d.push_back(10);
d.push_back(20);
d.push_back(100);
d.push_back(200);
printDeque(d);
//对beg和end区间内的数据进行排序
sort(d.begin(), d.end());
printDeque(d);
}
int main()
{
test();
return 0;
}
C++deque容器deque 排序
