Computer Science / Unit 3 CS 0148 short lesson, about 20 seconds
Heapsort
Captions available
The idea
Heapsort adds every element to a binary heap, comparison as priority, then removes the top repeatedly — each removal yielding the next element in order, at cost O(N log N).
In practice
A triage board emptied most-urgent-first walks out in sorted order by construction.
Where people slip
The heap does the thinking; the loop does the emptying.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
- Nothing yet depends on this.
Something wrong in this lesson? Flag it · Sources for Computer Science