6.deque排序

#include<iostream>
using namespace std;

#include<deque>
#include<algorithm>

void Print(const deque<int> d)
{
    for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
    {
        cout << (*it) << " ";
    }
    cout << endl;
}


void test0601()
{
    deque<int> d1;
    d1.push_back(1);
    d1.push_back(5);
    d1.push_back(2);
    d1.push_back(5);
    d1.push_back(7);
    d1.push_back(9);

    Print(d1);

    //对于支持随机访问的迭代器的容器，都可以利用sort算法直接对其进行排序比如vector
    //默认排序为升序排序
    sort(d1.begin(),d1.end());
    Print(d1);

}
int main()
{

    test0601();
    system("pause");
    return 0;
}