Heapsort Visualization – AP CSA

In-Place O(N log N)

Heapsort beautifully bridges arrays and trees. It treats a flat array as a Complete Binary Tree without extra memory overhead.

Index Math

Parent(i) = (i-1)/2

LeftChild(i) = 2i + 1

RightChild(i) = 2i + 2

Sorting Phases

1. Build Max Heap: heapify() up the array so parents > children.

2. Extract Max: Swap top node (the max) with the last unsorted node, then heapify() the root again.

Tags

HeapsortO(N log N)In-PlaceBinary Heap

Logical View (Complete Binary Tree)

Physical View (Flat Array Memory)

Execution Control

Metrics

Comparisons:

Swaps:

Current Phase

Waiting to compile...