Heapsort
-
Heap SortAlgoDS/Algorithm 2020. 1. 16. 23:03
1. Overview Heapsort is a comparison based sorting technique based on a Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end. We repeat the same process for the remaining element. 2. Description 2.1 Procedure Build a max heap from the input data. At this point, the largest item is stored at the root of the he..