Rolling Median Sort
Maintain the median of a sliding window using two heaps while the window moves over a stream.
Tag
Heaps
4 notes
Median Maintenance by Two Heaps
Maintain the median of a stream using a max heap and a min heap.
6.12 Top k Selection
Find the largest or smallest k elements without sorting the full input, using a heap or partition-based approach.
6.6 Heap Sort
Build a max-heap in place, then repeatedly extract the maximum to produce a sorted array in O(n log n) worst-case time.