假设含n个记录的序列为{R1, R2, …, Rn}.pptVIP

void merge(RecordNode *r,RecordNode *r1,int low,int m,int high) { int i,j,k; i=low; j=m+1; k=low; while( (i=m) (j=high) ) { if(r[i].key=r[j].key) r1[k++]=r[i++]; else r1[k++]=r[j++]; } while (i=m) r1[k++]=r[i++]; while (j=high) r1[k++]=r[j++]; } void mergePass(RecordNode r[], RecordNode r1[], int n, int length) { int i, j; i=0; while(i+2*length-1n) { merge(r,r1,i,i+length-1,i+2*length-1); i+=2*length; } if(i+length-1n-1) merge(r,r1,i,i+length-1,n-1); else for(j=i; jn; j++) r1[j]=r[j]; } void mergeSort(Sort