HF RL Explorer

Task: Analyze and Verify the 2n/3 Worst Case Ratio in MAX-HEAPIFY

Task: Analyze and Verify the 2n/3 Worst Case Ratio in MAX-HEAPIFY: a task in Terminal-Lego-15k (Harbor dataset). In the CLRS textbook (Introduction to Algorithms), the MAX-HEAPIFY algorithm analysis states that "The children's subtrees each have size at most 2n/3—the worst case occurs when the…

The task

In the CLRS textbook (Introduction to Algorithms), the MAX-HEAPIFY algorithm analysis states that "The children's subtrees each have size at most 2n/3—the worst case occurs when the bottom level of the tree is exactly half full."

Part of PrimeIntellect/Terminal-Lego-15k.