归并排序

一个丑陋的归并排序

#include <bits/stdc++.h>
using namespace std;
#define ls l,mid
#define rs mid+1,r
#define mi (l+r)/2
const int MAXN=1e6+7;
int a[MAXN],b[MAXN];
void conbine(int l,int mid,int r){
    int lp=l,rp=mid+1,pos=l;
    while(pos<=r){
        if(lp<=mid&&rp<=r){
            if(a[lp]<=a[rp]){
                b[pos]=a[lp];
                lp++;
            }else{
                b[pos]=a[rp];
                rp++;
            }
        }else if(lp<=mid){
            b[pos]=a[lp];
            lp++;
        }else{
            b[pos]=a[rp];
            rp++;
        }
        pos++;
    }
    for(int i=l;i<=r;i++) a[i]=b[i];
}
void merge(int l,int r){
    if(l==r) return ;
    int mid=mi;
    merge(ls);merge(rs);
    conbine(l,mid,r);
}
int main()
{
    int n;
    while(scanf("%d",&n)!=-1){
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        merge(1,n);
        for(int i=1;i<=n;i++) printf("%d ",a[i]);
        puts("");
    }
}
/*
10
1541 1511 74877 5 0 41584 3581 2 6 6541111
10
1 2 3 4 5 6 7 8 9 10
*/