【七】归并排序

归并排序

归并排序的思想：类似于二叉树的后序遍历（根左右）。（递推过程中分组，回归过程中排序合并数据）

//归并排序（递归）
#if 1
//有序合并
void Merge(int* src, int* des, int left, int mid, int right)
{
	int i = left;
	int j = mid + 1;
	int k = left;
	while (i <= mid && j <= right)
	{
		des[k++] = src[i] <= src[j] ? src[i++] : src[j++];
	}
	while (i <= mid)
	{
		des[k++] = src[i++];
	}
	while (j <= right)
	{
		des[k++] = src[j++];
	}
}
//拷贝
void Copy(int* src, int* des, int left, int right)
{
	if (nullptr == des || nullptr == src) return;
	while (left <= right)
	{
		src[left] = des[left];
		++left;
	}
}
//归并
void MergePass(int* arr, int* des, int left, int right)
{
	if (left < right)
	{
		int mid = (left + right) / 2;
		MergePass(arr, des, left, mid);
		MergePass(arr, des, mid + 1, right);
		//有序合并到des
		Merge(arr, des, left, mid, right);
		//有序des复制到arr
		Copy(arr, des, left, right);
	}
}
//排序
void MergerSort(int* arr, int len)
{
	if (nullptr == arr || len < 2) return;
	int* tmp = new int[len];
	MergePass(arr,tmp , 0, len - 1);
	delete[] tmp;
}
int main()
{
	int arr[] = { 12, 23, 56, 45, 78, 42, 12, 45, 42, 12 };
	int len = sizeof(arr) / sizeof(arr[0]);
	MergerSort(arr, len);
	for (const int& x : arr)
	{
		cout << x << " ";
	}
	return 0;
}
#endif