归并排序思路简介

#include<iostream>
using namespace std;

const int N = 100010;

int q[N],tmp[N];

void merge_qort(int q[],int l,int r)
{
    if(l>=r) return;
    //取中间数
    int mid = (l+r)/2;
    
    //划分区间
    merge_qort(q,l,mid);
    merge_qort(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++){
        q[i] = tmp[j++];
    }
}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&q[i]);
    }
    
    merge_qort(q,0,n-1);
    
    for(int i=0;i<n;i++)
    {
        printf("%d ",q[i]);
    }
}