Heapsort 策略：基于选择还是交换？

Question

我无法决定哪种方法更适合 HeapSort。选择根或者它用最后一个元素改变它的事实？这两个哪个是正确的？

Answer 1

根据these lecture notes

Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family.

Heapsort is similar to selection sort in that it locates the largest value and places it in the final array position.

所以基于选择似乎是正确的。