分治法排序

#include <iostream>

using namespace std;


#define MAX 0x7fffffff

//arr[p..q]与arr[q+1..r]已经排好序，本代码将这两段排好的合起来
void Merge(int *arr, int p, int q, int r)
{
	int n1 = q - p + 1;    //arr[p..q]的长度为n1
	int n2 = r - q;        //arr[q+1..r]的长度为n2
	int *L = new int[n1 + 1];
	int *R = new int[n2 + 1];
	for (int i = 0; i < n1; i++)
		L[i] = arr[p + i];
	for (int j = 0; j < n2; j++)
		R[j] = arr[q + j + 1];
	L[n1] = MAX;
	R[n2] = MAX;
	int i = 0, j = 0;
	for (int k = p; k < r; k++)
	{
		if (L[i] <= R[j])
		{
			arr[k] = L[i];
			i = i + 1;
		}
		else
		{
			arr[k] = R[j];
			j = j + 1;
		}
	}
}



//分治法排序
void MergeSort(int *arr, int p, int r)
{
	if (p < r)
	{
		int q = (int)((p + r) / 2);
		MergeSort(arr, p, q);
		MergeSort(arr, q + 1, r);
		Merge(arr, p, q, r);
	}
}

int main()
{
	int Arr[] = { 1, 2, 5, 8, 6, 7, 9, 7, 4, 8, 5, 12, 5, 35, 78 };
	MergeSort(Arr,0,14);
	for (int i = 0; i < 15; i++)
		cout << Arr[i] << " ";
	cout << endl;
	return 0;
}