归并排序之分治思想

将有序序列分为两部分分别进行排序，不断递归得到有序序列，需开辟一个额外的数组。

代码如下：

#include<iostream>
using namespace std;
void MergeSort(int arr[], int low, int mid, int high)
{
	int temp[100]{};
	int k = 0,i=low,j=mid+1;
	while (i <= mid && j <= high)
	{
		if (arr[i] < arr[j])
		{
			temp[k] = arr[i];
			k++;
			i++;
		}
		else
		{
			temp[k] = arr[j];
			k++;
			j++;
		}
	}
	if (i <=mid)
	{
		for (int m = i; m <= mid; m++)
		{
			temp[k] = arr[m];
			k++;
		}
	}
	if (j <= high)
	{
		for (int m = j; m <= high; m++)
		{
			temp[k] = arr[m];
			k++;
		}
	}
	for (int i = low,k=0; i <= high; i++,k++)
	{
		arr[i] = temp[k];
		
	}
}
void Merge(int arr[], int low, int high)
{
	if (low < high)
	{
		int mid = (low + high) / 2;
		Merge(arr, low, mid);
		Merge(arr, mid+1, high);
		MergeSort(arr, low, mid, high);
	}
}
int main()
{
	int  arr[10] = { 3,5,7,1,2,9,4,6,0,8 };
	Merge(arr, 0, 9);
	for (int i = 0; i < 10; i++)
	{
		cout << arr[i] << endl;
	}
}