递归排序

源代码：

#include<iostream>
using namespace std;

const int N = 1000010;

int n;
int q[N],tmp[N];

void maege_sort(int q[],int l, int r){
    if(l >= r) return;
    //中间值,l+r/2
    int mid =  l + r >> 1;
    //先递归
    maege_sort(q, l, mid), maege_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 ; i ++){
        scanf("%d",&q[i]);
    }

    maege_sort(q, 0, n-1);

    for(int i = 0 ; i < n ; i ++){
        printf("%d ",q[i]);
    }
}