Build a Max-Heap

A binary heap is a complete tree where every parent is at least as large as its children — stored as a plain array, with the children of index i at 2i+1 and 2i+2. Heapify works from the last parent backwards, sinking each value to where it belongs.

Machine twin: /dsa-viz-v2/heap-build.json — the full deterministic run as structured data.