c++常用排序算法

sort

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

/*sort
sort(v.begin(), v.end(), greater<int>());
//参数列表：1：起始迭代器，2：结束迭代器，3:谓词，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};

void test() {
	vector<int> v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	v.push_back(6);
	sort(v.begin(), v.end(), greater<int>());
	for_each(v.begin(), v.end(), MyPrint());
}

int main() {
	test();
	return 0;
}

random_shuffle

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

/*random_shuffle
random_shuffle(v.begin(), v.end())
//参数列表：1：起始迭代器，2：结束迭代器，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};

void test() {
	vector<int> v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	v.push_back(6);
	sort(v.begin(), v.end(), greater<int>());
	for_each(v.begin(), v.end(), MyPrint());
	cout << endl;
	random_shuffle(v.begin(), v.end());
	for_each(v.begin(), v.end(), MyPrint());
}

int main() {
	test();
	return 0;
}

merge

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

/*merge,合并v1，v2到v3，v1,v2必须有序且排序不能相反
merge(v.begin(), v.end(), v2.begin(), v2.end(), v3.begin());
//参数列表：1：v1起始迭代器，2：v1结束迭代器，3：v2起始迭代器，4：v2结束迭代器，5：v3起始迭代器，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};

void test() {
	vector<int> v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	v.push_back(6);
	sort(v.begin(), v.end());
	for_each(v.begin(), v.end(), MyPrint());
	cout << endl;

	vector<int> v2;
	for (int i = 0; i < 10; i++)
	{
		v2.push_back(i+2);
	}
	for_each(v2.begin(), v2.end(), MyPrint());
	cout << endl;

	vector<int> v3;
	v3.resize(v.size() + v2.size());
	merge(v.begin(), v.end(), v2.begin(), v2.end(), v3.begin());
	for_each(v3.begin(), v3.end(), MyPrint());
}

int main() {
	test();
	return 0;
}

reverse

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

/*reverse
reverse(v.begin(), v.end());
//参数列表：1：起始迭代器，2：结束迭代器
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};

void test() {
	vector<int> v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	v.push_back(6);
	sort(v.begin(), v.end());
	for_each(v.begin(), v.end(), MyPrint());
	cout << endl;

	reverse(v.begin(), v.end());
	for_each(v.begin(), v.end(), MyPrint());
}

int main() {
	test();
	return 0;
}