【递归】归并排序

#include <stdio.h>
#include <stdlib.h>

int a[10000],b[10000],n;


void Merge(int left,int mid,int right)
{
    int l=left,m=mid,k=left;
    while(l<mid&&m<=right)
    {
        if(a[l]<a[m])
        {
            b[k]=a[l];
            l++;
        }else
        {
            b[k]=a[m];
            m++;
        }
        k++;
    }
    if(l==mid)
    {
        while(m<=right){
            b[k]=a[m];
            k++;
            m++;
        }
    }
    if(m>right)
    {
        while(l<mid)
        {
            b[k]=a[l];
            k++;
            l++;
        }
    }
}

void copy(int left,int right)
{
    int l;
    for(l=left;l<=right; l++)
    {
        a[l]=b[l];
    }
}

void MergeSort(int left,int right)
{
    if(left<right)
    {
        if(right-left==1)
        {
            if(a[left]>a[right])
            {
                int g=a[left];
                a[left]=a[right];
                a[right]=g;
            }
        }
        else
        {
            int mid = left+(right-left)/2;
            MergeSort(left,mid);
            MergeSort(mid+1,right);
            Merge(left,mid+1,right);
            copy(left,right);
        }
    }

}


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