Tag
sift-down
- Jun 26, 2026 Bottom-Up Heap Construction in Linear Time Why sifting down from the middle of the array builds a heap in O(n) rather than O(n log n), and how the node-counting argument bounds the total work. data structures
- Jun 9, 2026 d-Ary Heaps and How Branching Factor Changes Cost Trading comparisons per level against levels per sift, why four children often beats two on real hardware, and where the arithmetic stops fitting in a register. data structures
- Oct 10, 2025 Array Layout and the Sift Invariant in Binary Heaps How a complete binary tree maps onto a flat array with no pointers, why the heap property is a partial order, and what sift-up and sift-down actually cost. data structures
- Jan 10, 2023 Min-Max Heaps and Double-Ended Extraction How alternating min and max levels let one array serve both ends of a priority queue, why sift-down needs two directions, and what the layout gives up. data structures