C++归并排序(merge sort)

归并排序的核心思想：如果要排序一个数组，我们先把数组从中间分成前后两部分，然后对前后两部分分别排序，再将排好序的两部分合并在一起，这样整个数组就都有序了。

归并排序使用的就是分治思想。将一个大问题分解成小的子问题来解决，而子问题的解决方法和原问题是相同的。所以分治算法一般都是用递归来实现的。分治是一种解决问题的处理思想，而递归是一种编程技巧。 

 

代码实现如下：

#include<iostream>
using namespace std;

void merge(int arr[], int low, int mid, int high)
{
	int i = low, j = mid + 1, k = 0;d
	int* temp = new int[high - low + 1];
	while (i <= mid && j <= high)
	{
		if (arr[i] <= arr[j])
			temp[k++] = arr[i++];
		else
		temp[k++] = arr[j++];
	}
	while (j <= high)
		temp[k++] = arr[j++];
	while (i <= mid)
		temp[k++] = arr[i++];
	for (i = low, k = 0;i <= high;i++, k++)
		arr[i] = temp[k];
	delete[]temp;
}

void mergeSort(int arr[], int low, int high)
{
	if (low < high)
	{
		int mid = (low + high) / 2;
		mergeSort(arr, low, mid);
		mergeSort(arr, mid + 1, high);
		merge(arr, low, mid, high);
	}
}

int main()
{
	int arr[] = { 2,6,3,7,4,6,23,67,4,6,78,34,56,23,0 };
	int num = sizeof(arr) / sizeof(arr[0]);
	cout << "数组中元素个数为：" << num << endl;
	cout << "打印数组中元素：";
	for (int i = 0;i < num;i++)
		cout << arr[i] << "  ";
	cout << endl;
	mergeSort(arr, 0, num - 1);
	cout << "打印排序后的元素：";
	for (int i = 0;i < num;i++)
		cout << arr[i] << "  ";
	return 0;
}