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: [ Ссылка ]
