← Back to Games
🏗️ Bottom-Up Heap Construction
Heapify Array — Build Heap in O(n) Time
🎮 Controls
▶ Start Heapify
🎲 New Array
↺ Reset
📊 Input Array
📋 Process Log
Start from last non-leaf (index n/2 - 1)
💡 Algorithm
1. Start from last non-leaf
2. Heapify each node (bubble down)
3. Move towards root
Time: O(n)