Heaps and Heap Sort

A demonstration of heaps, heap sort, and a competition with merge-sort. See here a more detailed discussion of the properties of heap sort. Note that the procedures mentioned in the video, “sift-down“, “heapify“, and “sift-up“, may be named differently in different descriptions of heapsort. The implementation is the same though. Links: --------- More details about this video: Previous matches: Merge Sort vs Quick Sort: Quick Sort vs Bubble Sort: Next match: Visit my homepage: