归并排序：先递归，再合并

#include<iostream>
#include<cstdio>

using namespace std;

const int N = 100010;

int q[N];

int 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 i = l, j = mid + 1, k = 0;
    int temp[N];
    
    // 再合并
    while(i<=mid && j<=r)
    {
        if(q[i] <= q[j]) temp[k++] = q[i++];
        else temp[k++] = q[j++];
    }
    
    while(i<=mid) temp[k++] = q[i++];
    while(j<=r) temp[k++] = q[j++];
    
    for(i=l, j=0; i<=r; i++, j++) q[i] = temp[j];
}

int main()
{
    cin >> 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]);
}