This video is part of Professor Frank Stajano’s lecture course on Algorithms at the University of Cambridge.
Heapsort is an in-place sorting algorithm that achieves optimal time complexity of O(n lg n). What’s not to like? It achieves this result through the use of a remarkable data structure called the binary heap, of which I am especially fond.
If you like this video, give it a thumbs up. Subscribe and hit the notification bell for more of the same. Leave your comments below.
Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithms/
Course handout:
https://www.cl.cam.ac.uk/teaching/2021/Algorithms/2020-2021-stajano-algs-handout.pdf
My home page:
http://frank.stajano.com
Add comment