Finding the k-th largest value is a frequent interview question with three good answers. Sorting is simplest at O(n log n), a size-k min-heap gives O(n log k) and works on a stream, and quickselect gives O(n) on average. Use the heap when data arrives one by one or k is small. Note that duplicates count separately, so it is the k-th position in sorted order, not the k-th distinct value.