en/chapter_heap/heap/

[giscus[bot]]

en/chapter_heap/heap/

Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code

https://www.hello-algo.com/en/chapter_heap/heap/

[codechriscode]

Extraordinary how hot checks on the heap[ma] and dynamically updating ma are essential parts for this to work.

        if (l < this.size() && this.#maxHeap[l] > this.#maxHeap[ma]) ma = l;
        if (r < this.size() && this.#maxHeap[r] > this.#maxHeap[ma]) ma = r;

If the selected node index for swapping isn't the one with the largest difference (in either max or min heaps), both looped and recursive approaches will fail to heapify in a single pass.