Heap Sort¶
Selection sort repeated finds the minimum element by traversing the unsorted part of the list. Heapsort improves upon this by quickly finding the maximum element through the maintenance of a max-heap.
Selection sort repeated finds the minimum element by traversing the unsorted part of the list. Heapsort improves upon this by quickly finding the maximum element through the maintenance of a max-heap.