局部排序（c++）

最新推荐文章于 2025-07-08 15:45:50 发布

want you tell me why

最新推荐文章于 2025-07-08 15:45:50 发布

阅读量827

点赞数

CC 4.0 BY-SA版权

分类专栏： c++基础

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

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

73 篇文章

订阅专栏

本文演示了C++中如何使用局部排序(partial_sort)和一边复制一边排序(partial_sort_copy)算法对数据进行排序。通过实例展示了不同排序方式的效果，包括按升序和降序排列。

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

c++局部排序

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

using namespace std;
int main()
{

	deque<int> ide;
	for (int i = 3; i <= 7; ++i)
		ide.push_back(i);
	for (int i = 2; i <= 6; ++i)
		ide.push_back(i);
	for (int i = 1; i <= 5; ++i)
		ide.push_back(i);
	for (auto iter = ide.begin(); iter != ide.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	//局部排序
	partial_sort(ide.begin(), ide.begin() + 5, ide.end());//只是前边的5个，排序了
	for (auto iter = ide.begin(); iter != ide.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	partial_sort(ide.begin(), ide.begin() + 5, ide.end(),greater<int>());
	for (auto iter = ide.begin(); iter != ide.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	cout << endl;

	//一边复制一边排序
	deque<int> ideq;
	vector<int> ivec6(6);
	vector<int> ivec30(30);

	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 (auto iter = ideq.begin(); iter != ideq.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	//只有6个位置，只能复制6个数据
	partial_sort_copy(ideq.begin(), ideq.end(), ivec6.begin(), ivec6.end());
	copy(ivec6.begin(), ivec6.end(), ostream_iterator<int>(cout, " "));
	cout << endl;

	//算法的返回值是copy过来的元素的下一个
	auto pos=partial_sort_copy(ideq.begin(), ideq.end(), ivec30.begin(), ivec30.end(),greater<int>());
	copy(ivec30.begin(), pos, ostream_iterator<int>(cout, " "));

	//后边的数据不显示

	system("pause");
	return 0;
}