EPIJ Problem 11.8 variant 2 - Find kth largest element


#1

The problem states to find the kth largest element in an array when there may be duplicate elements and when elements are stable sorted.

I’d like to know if it’s possible to do better than O(n) time and O(n) space.

Thanks!