#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
void print1(int val)
{
cout << val << " ";
}
void test()
{
vector<int> v;
vector<int> v1;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
v1.push_back(i);
}
vector<int> vTarget;
vTarget.resize(v.size()+v1.size());
merge(v.begin(),v.end(),v1.begin(),v1.end(),vTarget.begin());
for_each(vTarget.begin(), vTarget.end(), print1);
cout << endl;
}
int main()
{
test();
return 0;
}
常用排序算法-merge
最新推荐文章于 2024-06-11 22:29:04 发布