Skip to content
Skein

k-th largest element

RU: k-й по величине элемент

The element that would sit at position k if the values were sorted in descending order. A min-heap of size k finds it in O(n log k) time and O(k) space: after processing all elements the heap holds the k largest, and its root is the answer.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?