二分归并排序

二分归并排序：对n个不同的数构成的数组A[1…n]进行排序，其中n=2^k；

#include<stdio.h>
#include<stdlib.h>
#define MAX 10
void mergearray(int A[], int first, int mid, int last, int temp[])
{
	int i = first, j = mid + 1;
	int m = mid, n = last;
	int k = 0;

	while (i <= m && j <= n)
	{
		if (A[i] <= A[j])
			temp[k++] = A[i++];
		else
			temp[k++] = A[j++];
	}

	while (i <= m)
		temp[k++] = A[i++];

	while (j <= n)
		temp[k++] = A[j++];

	for (i = 0; i < k; i++)
		A[first + i] = temp[i];
}
void mergesort(int A[], int first, int last, int temp[])
{
	if (first < last)
	{
		int mid = (first + last) / 2;
		mergesort(A, first, mid, temp);
		mergesort(A, mid + 1, last, temp);
		mergearray(A, first, mid, last, temp);
	}
}

int main() {
	int A[10];
	int B[10];
	for (int i = 0; i < MAX; i++) {
		scanf_s("%d", &A[i]);
	}
	mergesort(A, 0, 9, B);
	for (int i = 0; i < MAX; i++) {
		printf("%d  ", A[i]);
	}
}