递归归并排序

const int maxn = 100;
void merge(int A, int L1, int R1, int R1, int R2) {

	int i = L1; int j = L2;
	int temp[maxn], index = 0; //temp为临时存放合并后的数组，index为其下标
	while (i <= R1 && j <= R2) {
		if (A[i] < A[j]) {
			temp[index++] = A[i++];
		}
		else {
			temp[index++] = A[j++];
		}
	}
	while (i <= R1) temp[index++] = A[i++];
	while (j <= R1) temp[index++] = A[j++];
	for (i = 0; i < index; i++) {
		A[L1 + i] = temp[i];  //将合并后的序列赋值回数组A
	}
}
void mergeSort(intA[], int left, int right) {
	if (left < right) {
		int mid = (left + right) / 2;
		mergesort(A, left, mid);          //递归，将左子区间归并排序区间
		mergesort(A, mid + 1, right);     //递归，将右子区间归并排序
		merge(A, left, mid, mid + 1, right);        //左右合并
	}
}