归并排序

#include <iostream>

using namespace std;
void Merge(int r[],int r1[],int s,int m,int t)
{
    int i=s,j=m+1,k=s;
    while(i<=m&&j<=t)
    {
        if(r[i]<r[j])
        r1[k++]=r[i++];
        else
        r1[k++]=r[j++];
    }
    while(i<=m)
        r1[k++]=r[i++];
    while(j<=t)
        r1[k++]=r[j++];

}
void MergePass(int r[],int r1[],int n,int h)
{
    int i=1;
    while(i<=(n-2*h+1))
    {
        Merge(r,r1,i,i+h-1,i+2*h-1);
        i+=2*h;
    }
    if(i<n-h+1)
        Merge(r,r1,i,i+h-1,n);
    else
        for(int k=i;k<=n;k++)
    {
        r1[k]=r[k];
    }

}
void Merge_sort(int r[],int r1[],int n)
{
    int h=1;
    while (h<=n)
    {
        MergePass(r,r1,n,h);
        h=2*h;
        MergePass(r1,r,n,h);
        h=2*h;
    }
}
int main()
{
int a[10]={10,9,8,7,6,5,4,3,2,1};
int b[10];
Merge_sort(a,b,10);
for(int i=1;i<=10;i++)
{
    cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}