学步园

//MergeTest.cpp
#include <algorithm>
#include "PrintSequence.h"
#include "Generators.h"
using namespace std;
//使用以下方法必须是已排序的序列
int main()
{
	const int SZ = 15;
	int a[SZ * 2] = {0};

	generate(a, a + SZ, SkipGen(0, 2));
	a[3] = 4;
	a[4] = 4;
	generate(a + SZ, a + SZ*2, SkipGen(1, 3));
	print(a, a + SZ, "range1", " ");
	print(a + SZ, a + SZ*2, "rage2", " ");
	print(a, a + SZ*2, "a", " ");

	int b[SZ * 2] = {0};
	//将两个序列中的元素以升序的顺序复制到b，是稳定的运算
	merge(a, a + SZ, a + SZ, a + SZ*2, b);
	print(b, b + SZ*2, "merge", " ");

	for(int i = 0; i < SZ*2; i++)
		b[i] = 0;

	//它与merge的调用有相同的标识符及类似的行为，除了它从第二个集合中删除副本
	int *end = set_union(a, a + SZ, a + SZ, a + SZ*2, b);//它
	print(b, end, "set_union", " ");
	
	//将相同序列中已排好序的两部分的元素合并，合并后也是有序的序列
	inplace_merge(a, a + SZ, a + SZ*2);
	print(a, a + SZ*2, "inplace_merge", " ");


	system("pause");
	return 0;
}

/*
结果：
range1:  0 2 4 4 4 10 12 14 16 18 20 22 24 26 28
rage2:  1 4 7 10 13 16 19 22 25 28 31 34 37 40 43
a:  0 2 4 4 4 10 12 14 16 18 20 22 24 26 28 1 4 7 10 13 16 19 22 25 28 31 34 37
40 43
merge:  0 1 2 4 4 4 4 7 10 10 12 13 14 16 16 18 19 20 22 22 24 25 26 28 28 31 34
 37 40 43
set_union:  0 1 2 4 4 4 7 10 12 13 14 16 18 19 20 22 24 25 26 28 31 34 37 40 43

inplace_merge:  0 1 2 4 4 4 4 7 10 10 12 13 14 16 16 18 19 20 22 22 24 25 26 28
28 31 34 37 40 43

*/