C++ 代码

#include <iostream>

using namespace std;
const int N = 1e6+10;
int temp[N], q[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;
    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 = 0, j = l; i < k; i++, j++)
    {
        q[j] = temp[i];
    }
}

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