Skip to main content

Heapsort

This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.

State

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).

Show

A triage board emptied most-urgent-first walks out in sorted order by construction.

Watch for

The heap does the thinking; the loop does the emptying.

Builds on

Unlocks

  • Nothing yet depends on this.