#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <algorithm>
#include <ctime>
using namespace std;
//stl常见算法
/*
1.algorithm
2.numeric
3.functional
*/
void mprint(int val)
{
cout << val << " ";
}
//常用排序算法merge
//内置数据类型
void test01()
{
//重要说明 v1 v2 必须是有序的。无序的无法合并 ,merge 后 v3 也是有序的
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i+5);
}
for_each(v1.begin(), v1.end(), mprint);//0 1 2 3 4 5 6 7 8 9
cout << endl;
for_each(v2.begin(), v2.end(), mprint);//5 6 7 8 9 10 11 12 13 14
cout << endl;
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(), mprint);//0 1 2 3 4 5 5 6 6 7 7 8 8 9 9 10 11 12 13 14
cout << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
87 常用排序算法-merge
最新推荐文章于 2024-08-24 16:09:10 发布