算法从0开始 C++ 归并排序

#include<iostream>
using namespace std;
const int N= 1e6 + 10;
int n;
int q[N],temp[N];
void merge_sort(int q[],int l,int r){
    if(l>=r)return;
    int midle=(l+r)>>1;
    merge_sort(q,l,midle);
    merge_sort(q,midle+1,r);//递归
    int k=0;int i=l;int j=midle+1;
    while(i<=midle&&j<=r){
        if(q[i]<=q[j]){
            temp[k++]=q[i++];


        }
        else{
            temp[k++]=q[j++];
        }
    }
    while(i<=midle){
        temp[k++]=q[i++];  }
    while(j<=r){
        temp[k++]=q[j++];
    }
for(int i=l,j=0;i<=r;i++,j++)
    q[i]=temp[j];
}
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;
}