华南理工大学数据结构与算法课件Chapter9 Internal Sorting.pptVIP

Program 9-19 the Algorithm of Merge Sort templateclass T void MergeSort(SqListT L) { //merge sort order form L RedTypeT *rr=L.r; RedTypeT *TR2=new RedTypeT[L.length+1]; MSort1(L.r, rr, TR2, 1, L.length); delete TR2[]; } //MergeSort 【Example 9-8】Shown in Fig.9.10 is an example of 2-ways Merge Sort. 9.6 Radix Sort9.6.1 The Sort of Multi Key Codes(1)Definition Suppose there is a sequence with n records {R1, R2, …, Rn}, and each record Ri contains d key codes (Ki0, Ki1, …, KiD-1)), the above sequence is called ordered to key codes (Ki0, Ki1, …, KiD-1), for a