python归并排序递归_归并排序（递归）

#include

using namespace std;

#define MAXSIZE 20

typedef struct{

int key;

char *otherinfo;

}RedType;

typedef struct{

RedType *r;

int length;

}SqList;

void Create_Sq(SqList &L){

int i,n;

cout<

cin>>n;

cout<

for(i=1;i<=n;i++){

cin>>L.r[i].key;

L.length++;

}

}

//相邻两个有序子序列归并

void Merge(RedType R[],RedType T[],int low,int mid,int high){

int i,j,k;

i=low; j=mid+1;k=low;

while(i<=mid&&j<=high){

if(R[i].key<=R[j].key) T[k++]=R[i++];

else T[k++]=R[j++];

}

while(i<=mid)

T[k++]=R[i++];