2020年7月第4题 PAT甲级真题 Replacement Selection (30分)

浒鱼鱼

于 2020-07-28 23:14:35 发布

阅读量5.5k

点赞数 13

CC 4.0 BY-SA版权

分类专栏： PAT甲级文章标签： 2020年春 pat甲级最后一题第四题优先队列

本文链接：https://blog.youkuaiyun.com/allisonshing/article/details/107626332

本文介绍了Donald Knuth提出的置换选择排序算法，该算法用于外部排序。当内存不足以一次性存储所有数据时，通过每次读取内存容量大小的数据进行内部排序，然后输出最小值并释放内存，继续读取下一个数据。文章提供了算法的详细解释、C++代码实现以及样例测试。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

When the input is much too large to fit into memory, we have to do external sorting instead of internal sorting. One of the key steps in external sorting is to generate sets of sorted records (also called runs) with limited internal memory. The simplest method is to read as many records as possible into the memory, and sort them internally, then write the resulting run back to some tape. The size of each run is the same as the capacity of the internal memory.

Replacement Selection sorting algorithm was described in 1965 by Donald Knuth. Notice that as soon as the first record is written to an output tape, the memory it used becomes available for another record. Assume that we are sorting in ascending order, if the next record is not smaller than the record we have just output, then it can be included in the run.

For example, suppose that we have a set of input { 81, 94, 11, 96, 12, 99, 35 }, and our memory can sort 3