容器合并排序算法-----merge

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<ctime>
//random_shuffle
void p(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int> v = { 1,2,3,4,5,6,7,8,9 };
	vector<int> v1 = { 1,5,8,10,15,26,34 };
	vector<int> v2;
	v2.resize(v.size() + v1.size());
	merge(v1.begin(), v1.end(), v.begin(), v.end(), v2.begin());
	for_each(v2.begin(), v2.end(), p);
	
}
int main()
{

	srand((size_t)time(NULL));
	test01();
	cout << endl;
	system("pause");
	return 0;
}