归并排序

#define MAXN 50100
int num[MAXN];
int temp[MAXN];
int n;

void (int l, int mid, int r)
{
    int rlen = 0;
    int i = l;
    int j = mid+1;
    while(i <= mid && j <= r)
    {
        if(num[i] < num[j])
            temp[rlen++] = num[i++];
        else
            temp[rlen++] = num[j++];
    }
    while(i <= mid)
        temp[rlen++] = num[i++];
    while(j <= r)
        temp[rlen++] = num[j++];

    for(int i = 0; i < rlen; ++i)
        num[l+i] = temp[i];

}

void MergeSort(int l, int r)
{
    if(l >= r)
        return;
    int mid = (l+r) >> 1;
    MergeSort(l,mid);
    MergeSort(mid+1,r);
    Merge(l,mid,r);
}

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