Mergesort-归并排序

#include<iostream>

using namespace std;

void Merge(intr[],int r1[],int s,int m,int t)
{
inti=s;
intj=m+1;
intk=s;
while(i<=m&&j<=t){
if(r[i]<=r[j]) r1[k++]=r[i++];
elser1[k++]=r[j++];
}
if(i<=m)
while(i<=m)r1[k++]=r[i++];
else
while(j<=t)r1[k++]=r[j++];
for(intl=s;l<=t;l++)
r[l]=r1[l];
}
void MergeSort(intr[],int r1[],int s,int t)
{
if(s==t)r1[s]=r[s];
else{
intm=(s+t)/2;
MergeSort(r,r1,s,m);
MergeSort(r,r1,m+1,t);
Merge(r1,r,s,m,t);
}
}

int main()
{
intr[8]={10,3,5,1,9,34,54,565},r1[8];
MergeSort(r,r1,0,7);
for(intq=0;q<8;q++)
cout<<""<<r[q];
return1;
}