stl::(13)常用排序算法

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <ctime>

using namespace std;

// merge算法 容器元素合并，并储存到另一个容器   这两个容器必须是有序的
void sortMerge()
{
	vector<int> v1;
	vector<int> v2;
	for (int i = 0; i < 5; i++)
	{
		v1.push_back(i);
		v2.push_back(i);
	}

	vector<int> v3;
	v3.resize(v1.size()+v2.size());

	merge(v1.begin(), v1.end(), v2.begin(), v2.end(),v3.begin());

	for_each(v3.begin(), v3.end(), [](int val) {cout << val << "-"; });
	cout << endl;
}

// sort算法  容器元素排序   这两个容器必须是有序的  返灰boo类型函数对象
void sortSort()
{
		vector<int> v1;
		for (int i = 0; i < 5; i++)
		{
			v1.push_back(i*10);
		}
		sort(v1.begin(),v1.end());
		for_each(v1.begin(), v1.end(), [](int val) {cout << val << "-"; });
		cout << endl;

		// 顺序反转
		sort(v1.begin(), v1.end(),greater<int>());
		for_each(v1.begin(), v1.end(), [](int val) {cout << val << "-"; });
		cout << endl;

}

// random_shuffle(iterator beg, iterator end) 洗牌
void sortRandomShuffle() 
{
	vector<int> v1;
	for (int i = 0; i < 5; i++)
	{
		v1.push_back(i * 10);
	}

	random_shuffle(v1.begin(), v1.end());
	for_each(v1.begin(), v1.end(), [](int val) {cout << val << " "; });
}

int main()
{
	sortMerge();
	sortSort(); 
	srand((unsigned int) time(NULL));   // 每次洗牌都不一样
	sortRandomShuffle();
}