归并排序1

吾乃无名小辈，欢迎改错~
C++实现归并排序

//归并核心
//#define MAX ∞ 必须超出数组最大元素
//instance :
//#define MAX 1000
void MERGE(int* A, int p, int q, int r) {
	int n1 = q - p + 1;
	int n2 = r - q;
	int* L = new int[n1 + 1];
	int* R = new int[n2 + 1];
	for (int i = 0; i < n1; ++i) {
		L[i] = A[p + i];
	}
	for (int j = 0; j < n2; ++j) {
		R[j] = A[q + 1 + j];
	}
	int i = 0;
	int j = 0;
	L[n1] = MAX;//哨兵
	R[n2] = MAX;//哨兵
	for (int k = p; k <= r; ++k) {
		if (L[i] <= R[j]) {
			A[k] = L[i];
			i++;
		}
		else {
			A[k] = R[j];
			j++;
		}
	}
}
//算法主过程
//A为数组地址，p为0，r为A.length-1
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);
	}
}

测试代码：

#include<iostream>
#include <cstdlib>
#include "inc.h"
using namespace std;

#define MAX 1000000;

int main() {
	//输入seed以产生一个随机数组A；
	unsigned seed;
	cin >> seed;
	srand(seed);
	int* A = new int[10];
	for (int i = 0; i < 10; i++) {
		A[i] = rand() % 1000 + 1;
	}
	for (int i = 0; i < 10; i++) {
		cout <<"A["<<i<<"]=" << A[i] << endl;
	}
	MERGE_SORT(A, 0, 9);
	cout << "排序后的数组:" << endl;
	for (int i = 0; i < 10; i++) {
		cout << "A[" << i << "]=" << A[i] << endl;
	}
	delete []A;//释放随机数组
}

结果：