Top K Sort
Extract and sort the top k elements (smallest or largest) from a sequence without fully sorting it.
Tag
Top-K
5 notes
Streaming Top K
Maintain the k largest elements while values arrive one at a time.
Top K by Quickselect
Find the k largest elements using partition-based selection in linear time.
Top K by Heap
Find the k largest or k smallest elements by maintaining a bounded 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.