Acwing_787（归并排序）

原题链接：

787. 归并排序 - AcWing题库

题解：

套板子即可

参考模板：常用代码模板1——基础算法 - AcWing

示意图：

代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N], tmp[N];

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);

	int k = 0, i = l, j = mid + 1;
	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++];
	while (j <= r) tmp[k++] = q[j++];

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

int main() {
	int n;cin >> n;
	for (int i = 0;i < n;i++) cin >> a[i];

	merge_sort(a, 0, n - 1);

	for (int i = 0;i < n;i++) cout << a[i] << " ";
}