Please enable JavaScript.
Coggle requires JavaScript to display documents.
Heps and Heapsort - Coggle Diagram
Heps and Heapsort
-
Heap Definition
Binary tree with a key per node, and two other conditions:
-
-
-
-
-
-
Heap as an array
recording its elements in the topdown, left-to-right fashion
-
every parental node in the first n/2 positions of the array, and leafs on the last n/2 positions
-
-
Heapsort
Two stage algorithm
-
-
the array elements are eliminated in decreasing order, but elements deleted are placed at last, so it's sorted in increasing order
-