元素的排序

chosen13

于 2016-03-14 19:58:42 发布

阅读量198

点赞数

分类专栏：二级学习C++

本文链接：https://blog.csdn.net/qq_31248551/article/details/50889290

版权

二级学习C++ 专栏收录该内容

63 篇文章 0 订阅

订阅专栏

#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;
}