归并排序

归并排序有三个步骤：
1.确定中间值 mid = （l + r） / 2;
2.递归排序中间值左边，中间值右边；
3.将两个数组归并为一个数组；
代码：

#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int n;
int q[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()
{
	scanf("%d",&n);
	for(int i = 0; i <= n - 1; i ++ ) scanf("%d",&q[i]);
	
	merge_sort(q, 0, n - 1);
	
	for(int i = 0; i <= n - 1; i ++ ) printf("%d ",q[i]);
}

代码借鉴：
作者：yxc
链接：https://www.acwing.com/blog/content/277/