AcWing归并排序

#include <iostream>
using namespace std;

const int N = 1e6 + 10;

int n, q[N], j, k, tmp[N], i;

void merge_sort(int q[], int l, int r)
{
	if (l >= r)return;
	int mid = l + r >> 1;
	merge_sort(q, l, mid), merge_sort(q, mid + 1, r);//递归左右两段

	j = mid + 1, i = l, k = 0;

	while (i <= mid && j <= r)             //通常情况
		if (q[i] <= q[j])tmp[k++] = q[i++];
		else tmp[k++] = q[j++];

	while (i <= mid)tmp[k++] = q[i++];     //特殊情况1
	while (j <= r)tmp[k++] = q[j++];       //特殊情况2

	for (i = l, j = 0;i <= r;i++, j++)q[i] = tmp[j];
}

int main()
{
	scanf("%d", &n);
	for (int i = 0;i < n;i++)scanf("%d", &q[i]);
	merge_sort(q, 0, n - 1);
	for (int i = 0;i < n;i++)printf("%d ", q[i]);
	return 0;
}