第3章 排序.pptVIP

52, 23, 80, 36, 68, 14 (s=1, t=6) [ 52, 23, 80] [36, 68, 14] [ 52, 23] [80] [ 52] [ 23, 52] [ 23, 52, 80] [36, 68] [14] [36] [36, 68] [14, 36, 68] [ 14, 23, 36, 52, 68, 80 ] [23] [ 52] [23] [36] [68] [80] [14] [68] void Msort ( RcdType SR[], RcdType TR1[], int s, int t ) //算法 3.10 { // 对SR[s..t]进行归并排序，排序后的记录存入TR1[s..t] RcdType TR2[t-s+1]; //开设用于存放归并排序中间结果的辅助空间 if (s==t) TR1[s] = SR[s]; else { m = (s+t)/2; // 将SR[s..t]平分为SR[s..m]和SR[m+1..t] Msort (SR, TR2, s, m); // 递归地将SR[s..m]归并为有序的TR2[s..m] Msort (SR, T