排序算法

最新推荐文章于 2024-11-10 18:26:35 发布

want you tell me why

最新推荐文章于 2024-11-10 18:26:35 发布

阅读量123

点赞数

CC 4.0 BY-SA版权

分类专栏： c++基础

本文链接：https://blog.youkuaiyun.com/weixin_42655231/article/details/82866546

c++基础专栏收录该内容

73 篇文章

订阅专栏

本文展示了一个使用C++标准库中的deque容器和多种STL算法的实例，包括push_back、nth_element、copy、partition等函数的应用。通过具体代码演示了如何对deque中的元素进行插入、排序和分区操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

using namespace std;

int main()
{
  	deque<int>  ideq;
	for (int i = 3; i <= 7; ++i)
		ideq.push_back(i);
	for (int i = 2; i <= 6;++i)
		ideq.push_back(i);
	for (int i = 1; i <= 5; ++i)
		ideq.push_back(i);

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

	nth_element(ideq.begin(), ideq.begin() + 3, ideq.end());
	copy(ideq.begin(), ideq.begin() + 4, ostream_iterator<int>(cout, " "));
	cout << endl;

	nth_element(ideq.begin(), ideq.end()-4,ideq.end());
	copy(ideq.begin(), ideq.begin() + 4, ostream_iterator<int>(cout, " "));
	cout << endl;

	nth_element(ideq.begin(), ideq.begin() + 3, ideq.end(), greater<int>());//从大到小排序
	copy(ideq.begin(), ideq.begin() + 4, ostream_iterator<int>(cout, " "));
	cout << endl;

	//分区算法
	auto pos = partition(ideq.begin(), ideq.end(), bind2nd(less_equal<int>(), 3));
	copy(ideq.begin(), pos, ostream_iterator<int>(cout, " "));
	cout << endl;

	system("pause");
	return 0;
}