数据结构考研分类复习真题 第十章 答案[29]

内部排序中的归并排序是在内存中进行的归并排序辅助空间为O(n)外部归并排序是将外存中的多个有序子文件合并成一个有序子文件将每个子文件中记录读入内存后的排序方法可采用多种内排序方法外部排序的效率主要取决于读写外存的次数即归并的趟数因为归并的趟数s=élogkmù其中m是归并段个数k是归并路数增大k和减少m都可减少归并趟数应用中通过败者树进行多(k)路平衡归并和置换选择排序减少m来提高外部排序的效率

初始败者树

初始归并段 R:

R:

R:

类似叙述题略

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []