0.前言

1.sort

#include <iostream>
using namespace std;// 常用排序算法 sort
#include<vector>
#include<algorithm>//利用仿函数 打印输出
class myPrint
{
public:void operator()(int val){cout << val << " ";}
};//利用普通函数 打印输出
void myPrint2(const int val) // const 可加可不加 因为形参不能改变实参
{cout << val << " ";
}void test01()
{vector<int>v;v.push_back(10);v.push_back(50);v.push_back(30);v.push_back(20);v.push_back(60);v.push_back(10);//默认从小到大 升序 排序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(), myPrint2);cout << endl;
}int main()
{test01();cout << "------------------------" << endl;//test02();//cout << "------------------------" << endl << endl;//test03();//**************************************system("pause");return 0;
} 

2.random_shuffle

#include <iostream>
using namespace std;// 常用排序算法 random_shuffle(洗牌算法，打乱顺序）
#include<vector>
#include<algorithm>
#include<ctime>//利用普通函数打印输出
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);}//遍历打印for_each(v.begin(), v.end(), myPrint);cout << endl;// 利用洗牌 算法 打乱顺序random_shuffle(v.begin(), v.end());//遍历打印for_each(v.begin(), v.end(), myPrint);cout << endl;
}int main()
{test01();cout << "------------------------" << endl;//test02();//cout << "------------------------" << endl << endl;//test03();//**************************************system("pause");return 0;
} 

3.merge

#include <iostream>
using namespace std;// 常用排序算法 merge
#include<vector>
#include<algorithm>void myPrint(int val)
{cout << val << " ";
}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();cout << "------------------------" << endl;//test02();//cout << "------------------------" << endl << endl;//test03();//**************************************system("pause");return 0;
} 

4.reverse

#include <iostream>
using namespace std;// 常用排序算法 reverse
//反转 首尾互换
#include<vector>
#include<algorithm>void myPrint(int val)
{cout << val << " ";
}void test01()
{vector<int>v;for (int i = 0; i < 10; i++){v.push_back(i);}cout << "反转前：" << endl;for_each(v.begin(), v.end(), myPrint);cout << endl;reverse(v.begin(), v.end());cout << "反转后：" << endl;for_each(v.begin(), v.end(), myPrint);cout << endl;
}int main()
{test01();cout << "------------------------" << endl;//test02();//cout << "------------------------" << endl << endl;//test03();//**************************************system("pause");return 0;
}