EPIJ 11.8 Variant 2 Find k-th largest element in an array containing duplicates


#1

The problem specifies that the solution should be the k-th largest, in stable sorted order. Is it possible to solve this in (best case) time O(n) and space O(1)?