【C++】常用排序算法

#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
#include<functional>
//常用排序算法 sort
void myPrint(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v;

	v.push_back(10);
	v.push_back(30);
	v.push_back(50);
	v.push_back(20);
	v.push_back(40);

	//利用sort进行升序
	sort(v.begin(), v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

	//改变为 降序
	sort(v.begin(), v.end(), greater<int>());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
}

int main() {
	test01();
	system("pause");

	return 0;
}
//总结：sort属于开发中最常用的算法之一，需熟练掌握

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<ctime>
//常用排序算法 random_shuffle

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

void test01()
{
	srand((unsigned int)time(NULL));
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}

	//利用洗牌算法打乱顺序
	random_shuffle(v.begin(), v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
}

int main() {
	test01();
	system("pause");

	return 0;
}

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
//常用排序算法merge

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

//常用排序算法 merge
void test01()
{
	vector<int>v1;
	vector<int>v2;

	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
		v2.push_back(i + 1);
	}
	//目标容器
	vector<int>vTarget;

	//提前给目标容器分配空间
	vTarget.resize(v1.size() + v2.size());
	merge(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
	for_each(vTarget.begin(), vTarget.end(), myPrint);
	cout << endl;
}

int main() {
	test01();
	system("pause");

	return 0;
}
//总结：merge合并的两个容器必须是有序序列

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
//常用排序算法reverse
void myPrint(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	v.push_back(50);

	cout << "反转前：" << endl;
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
	cout << "反转后：" << endl;
	reverse(v.begin (),v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
}

int main() {
	test01();
	system("pause");

	return 0;
}
//总结：reverse反转区间元素，面试题可能涉及到