1098. Insertion or Heap Sort (25)-PAT甲级真题（堆排序）

柳婼

已于 2023-11-09 16:53:29 修改

阅读量5.2k

点赞数 18

文章标签： PAT 算法

于 2016-08-19 16:31:34 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/52252172

版权

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