News
Clarification in Lecture 6
Written on 30.01.2026 18:59 by Sanyam Agarwal
Hi all,
There is a mistake on page 64 of Lecture 06. The best case runtime of Heapsort is mentioned as O(n), which is incorrect. The actual best case running time of Heapsort is Θ(n log n).
Best,
Sanyam