Definition
An algorithm used to find the ‘k’ largest or smallest elements, or the ‘k’ most frequent elements within a dataset, often an array.
Why it matters (in Poovi’s context)
Relevant for technical interviews as it tests understanding of data structures like heaps and sorting.
Key properties or components
- Identifies top k largest elements
- Identifies top k most frequent elements
- Often uses heaps or sorting
Contradictions or debates
None.