天津科技大学数据结构 排序.pptVIP

归并过程示例 (25) (57) (48) (37) (12) (92) (86) (25 57) (37 48) (12 92) (86) (25 37 48 57) (12 86 92) (12 25 37 48 57 86 92) 一趟归并算法 MERGEPASS(rectype R[],rectype R1[],int length) { int i,j; i=0; while (i+2*length-1n) { MERGE(R,R1,i,i+length-1,i+2*length-1); i=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]; } 归并算法 MERGE(rectypr R[],rectype R1[],int low,int mid,int high){ int i,j,k; i=low;