归并排序C++（Acwing）

代码：

#include <iostream>
using namespace std;

const int N = 1000010;

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++];//取两段小的放到tmp
        else tmp[k++] = q[j++];
    while(i <= mid) tmp[k++] = q[i++];//如果左段有剩下，就直接放入tmp
    while(j <= r) tmp[k++] = q[j++];//如果右段有剩下，就直接放入tmp
    
    for(i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];//最后将tmp赋给q
}

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