STL——常用排序算法

sort(iterator beg,iterator end,_pred)

	#include <iostream>
	#include<vector>
	#include<algorithm>
	using namespace std;

	void myprint(int val)
	{
		cout << val << " ";
	}
	//常用排序算法
	//sort
	void test1()
	{
		vector<int>v;
		v.push_back(5);
		v.push_back(4);
		v.push_back(3);
		v.push_back(3);
		v.push_back(2);
		v.push_back(1);
		
		//利用sort升序
		sort(v.begin(), v.end());
		for_each(v.begin(), v.end(), myprint);
		cout << endl;
		
		//降序
		sort(v.begin(), v.end(), greater<int>());

	}

random_shuffle(iterator beg,iterator end)：对区间内数据进行随机打乱

	#include <iostream>
	#include<vector>
	#include<algorithm>
	#include<ctime>
	using namespace std;

	void myprint(int val)
	{
		cout << val << " ";
	}
	//常用排序算法
	//sort
	void test1()
	{
		srand((unsigned int)time(NULL));
		vector<int>v;
		v.push_back(5);
		v.push_back(4);
		v.push_back(3);
		v.push_back(3);
		v.push_back(2);
		v.push_back(1);
		//进行打乱操作
		//如果只运行random_shuffle，每次打乱操作都会是相同的结果，如果想要每次都不同，需要加入srand
		random_shuffle(v.begin(), v.end());
		for_each(v.begin(), v.end(), myprint);

	}

merge(iterator beg1,iterator end1,iterator beg2,iterator end2,iterator dest)：将两个容器元素合并，并存储到另一个容器中

	#include <iostream>
	#include<vector>
	#include<algorithm>
	#include<ctime>
	using namespace std;

	void myprint(int val)
	{
		cout << val << " ";
	}

	void test1()
	{

		vector<int>v1;
		v1.push_back(5);
		v1.push_back(4);
		v1.push_back(3);
		v1.push_back(3);
		v1.push_back(2);
		v1.push_back(1);

		vector<int>v2;
		v2.push_back(5);
		v2.push_back(4);
		v2.push_back(3);
		v2.push_back(3);
		v2.push_back(2);
		v2.push_back(1);

		vector<int>v;
		//新容器需要提前分配内存空间
		v.resize(v1.size()+v2.size());
		merge(v1.begin(), v1.end(), v2.begin(), v2.end(), v.begin());
		for_each(v.begin(), v.end(), myprint);

	}

reverse(iterator beg,iterator end)：反转指定范围元素

	#include <iostream>
	#include<vector>
	#include<algorithm>
	#include<ctime>
	using namespace std;

	void myprint(int val)
	{
		cout << val << " ";
	}

	void test1()
	{

		vector<int>v1;
		v1.push_back(5);
		v1.push_back(4);
		v1.push_back(3);
		v1.push_back(3);
		v1.push_back(2);
		v1.push_back(1);

		reverse(v1.begin(), v1.end());
		for_each(v1.begin(), v1.end(), myprint);

	}