归并排序（归排）

#include<stdio.h>
int num[1000],a[1000];
void merge_sort(int left, int right)
{
	if (left >= right)return;
	int l = left, mid = (left + right) / 2, r = mid + 1,k=0;
	merge_sort(left, mid);
	merge_sort(mid + 1, right);
	while (l <= mid && r <= right)
	{
		if (num[l] > num[r])a[k++] = num[r++];
		else a[k++] = num[l++];
	}
	while (l <= mid)a[k++] = num[l++];
	while (r <= right)a[k++] = num[r++];
	for (k = 0, l = left; l <= right; l++, k++)num[l] = a[k];
}
int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &num[i]);
	}
	merge_sort(0, n - 1);
	for (int i = 0; i < n; i++)
	{
		printf("%d ", num[i]);
	}
}