PAT甲级——1098 Insertion or Heap Sort (插入排序、堆排序)

最新推荐文章于 2022-03-13 11:08:46 发布

Little Panda

最新推荐文章于 2022-03-13 11:08:46 发布

阅读量415

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签：堆排序插入排序

本文链接：https://blog.csdn.net/weixin_44385565/article/details/90941941

版权

该博客主要讨论PAT甲级试题1098，涉及插入排序和堆排序两种算法。通过给定的初始序列及部分排序后的序列，分析并判断所使用的排序方法，并进行下一步排序操作。文章提供了思路，指出若后续序列与原始数据一致则为插入排序，否则为堆排序，并给出了下一步操作的具体步骤。

摘要由CSDN通过智能技术生成

1098 Insertion or Heap Sort (25 分)

According to Wikipedia:

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.

Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?