归并排序

#include <iostream>
using namespace std;
void MergeSort(int *r,int *r1,int s,int t);
void Merge(int *r,int *r1,int s,int m,int t);
int main()
{
int number;
cin>>number;
int *r=new int[number+1];

int *r1=new int[number+1];

r[0]=number;

for(int i=1;i<=number;i++)
{
cin>>r[i];
}
MergeSort(r,r1,1,number);
for(int j=1;j<=number;j++)
{
cout<<r[j]<<" ";
}
return 0;
}
void MergeSort(int *r,int *r1,int s,int t)
{
int m;
if(s==t)r1[s]=r[s];
else
{
m=(s+t)/2;
MergeSort(r,r1,s,m);
MergeSort(r,r1,m+1,t);
Merge(r1,r,s,m,t);
for(int i=1;i<=r[0];i++)
{
r1[i]=r[i];
}


}
}
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++];
}
if(i<=m)
while(i<=m)r1[k++]=r[i++];
else while(j<=t)r1[k++]=r[j++];
}