归并排序模版

******归并排序复杂度n(logn)他的复杂度不会退化哦*.*

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
void Merge(int A[],int low,int middle,int high)
{
    int i,j,k;
    int *B = new int[high - low + 1];
    i = low;
    j = middle + 1;
    k = low;
    while(i <= middle && j <= high) //两个子序列非空
    {
        if(A[i] <= A[j]) 
            B[k++] = A[i++];
        else
            B[k++] = A[j++];
    }
    while(i <= middle)
    {
        B[k++] = A[i++];
    }
    while(j <= high)
    {
        B[k++] = A[j++];
    }
    for(i = low;i <= high;i++)
    {
        A[i] = B[i];
    }
}
void MergeSort(int A[],int low,int high)
{
    int middle;
    if(low < high)
    {
        middle = (low + high) / 2; //取中点 
        MergeSort(A,low,middle);
        MergeSort(A,middle + 1,high);
        Merge(A,low,middle,high); //合并 
    }
}
int main()
{
    int i,j,m,n,c[1005];
    scanf("%d",&n);
    for(i = 1;i <= n;i++)
    {
        scanf("%d",&c[i]);
     } 
     MergeSort(c,1,n);
     for(i = 1;i <= n;i++)
     {
         printf("%d",c[i]);
     }
     return 0;
}