#include<iostream>
using namespace std;
void merge(int r[],int r1[],int s,int m, int t)
{
int i,j,k;
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++];
}
}
while(--k>=s)
r[k]=r1[k]; //关键要把r1再赋给r;
}
void mergesort2(int r[],int r1[],int s,int t) //2路归并
{
int m=0;
if(s==t) r1[s]=r[s];
else {
m=(s+t)/2;
mergesort2(r,r1,s,m);
mergesort2(r,r1,m+1,t);
merge(r,r1,s,m,t);
}
}
void main()
{
int i=0;
int r[8]={8,3,2,6,7,1,5,4};
int r1[8]={0};
mergesort2(r,r1,0,7);
for(i=0;i<8;i++)
cout<<r[i]<<" ";
using namespace std;
void merge(int r[],int r1[],int s,int m, int t)
{
int i,j,k;
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++];
}
}
while(--k>=s)
r[k]=r1[k]; //关键要把r1再赋给r;
}
void mergesort2(int r[],int r1[],int s,int t) //2路归并
{
int m=0;
if(s==t) r1[s]=r[s];
else {
m=(s+t)/2;
mergesort2(r,r1,s,m);
mergesort2(r,r1,m+1,t);
merge(r,r1,s,m,t);
}
}
void main()
{
int i=0;
int r[8]={8,3,2,6,7,1,5,4};
int r1[8]={0};
mergesort2(r,r1,0,7);
for(i=0;i<8;i++)
cout<<r[i]<<" ";
}
还有些疑问