不使用标记实现的归并排序算法——Merge Sort

未使用标记，《算法导论》Exercise 2.3-2

#include <iostream>
using namespace std;
void Merge(int A[], int p, int q, int r)
{
	int n1 = q - p + 1;
	int n2 = r - q;
	int L[10];
	int R[10];
	for (int i = 0; i < n1; i++)
		L[i] = A[p + i];
	for (int j = 0; j < n2; j++)
		R[j] = A[q + j + 1];
	int i = 0;
	int j = 0;
	for (int k = p; k <= r; k++)
	{
		if (j >= n2 || (i < n1 && L[i] < R[j]))
		{
			A[k] = L[i];
			i++;
		}
		else 
		{
			A[k] = R[j];
			j++;			
		}
	}
}
void Merge_Sort(int A[], int p, int r)
{
	if (p < r)
	{
		int q = (p + r) / 2;
		Merge_Sort(A, p, q);
		Merge_Sort(A, q + 1, r);
		Merge(A, p, q, r);
	}
}
int main()
{
	int A[] = { 9, 8, 4, 12, 5, 6, 7, 3, 2, 1, 11, -1};
	int length = sizeof(A) / sizeof(int);
	Merge_Sort(A, 0, length - 1);
	for (int i = 0; i < length; i++)
		cout << A[i] << endl;
	system("pause");
	return 0;
}