归并排序

//7.归并排序
void Merge(int a[], int left, int mid, int right)
{
	int len = right - left + 1;        //    数组的长度
	int *temp = new int[len];       // 分配个临时数组
	int k = 0;
	int i = left;                   // 前一数组的起始元素
	int j = mid + 1;                // 后一数组的起始元素
	while (i <= mid && j <= right)
	{
		//    选择较小的存入临时数组
		temp[k++] = a[i] <= a[j] ? a[i++] : a[j++];
	}
	while (i <= mid)
	{
		temp[k++] = a[i++];
	}
	while (j <= right)
	{
		temp[k++] = a[j++];
	}
	for (int k = 0; k < len; k++)
	{
		a[left++] = temp[k];
	}
}

void MergeSort(int* a, int left, int right)
{
	if (left == right)
		return;
	int middle = (left + right) / 2;
	MergeSort(a, left, middle);
	MergeSort(a, middle + 1, right);
	Merge(a, left, middle, right);
}