08-heaps

Top-K with a Heap

Keep only the largest k values by maintaining a small min-heap.

Algorithm

@steps

  1. Store the heap in an array.
  2. Compare parent and child indexes instead of building explicit tree nodes.
  3. Swap only when the heap order is violated.
  4. Print the deterministic final heap state for replay comparison. @end @complexity
  • Time: O(n log k)
  • Space: O(k) @end
bounded heap For top-k largest values, a min-heap of size k keeps the current cutoff at the root.

SQL DSA Implementation

basic.sql 
SELECT '[9, 7, 5]';

@end @output [9, 7, 5] @end