Sorting
Build a max-heap, then repeatedly move the maximum to the end.
Detailed interactive content for “Heap Sort” is planned for a later phase.
Build a max-heap, then repeatedly move the maximum to the end.
The visualization engine is ready to be extended to this topic — the 12 core demonstrations below are fully interactive today.