归并排序（通俗易懂版）

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int a[maxn],b[maxn];
int n;
void Merge(int a[],int low,int mid,int high){
    int i,j,k;
    for(i=low;i<=high;i++)
        b[i]=a[i];
    for(i=low,j=mid+1,k=i;i<=mid&&j<=high;k++)
    {
        if(b[i]<=b[j])
            a[k]=b[i++];
        else
            a[k]=b[j++];
    }
    while(i<=mid)a[k++]=b[i++];
    while(j<=high)a[k++]=b[j++];
}
void MergeSort(int a[],int low,int high){
    if(low<high){
        int mid=(low+high)/2;
        MergeSort(a,low,mid);
        MergeSort(a,mid+1,high);
        Merge(a,low,mid,high);
    }
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    MergeSort(a,1,n);
    for(int i=1;i<=n;i++){
        if(i!=1)
            cout<<" ";
        cout<<a[i];
    }
    cout<<endl;
    return 0;
}