Kth Largest Element in an Array

Min-heap approach: push all elements, maintain size k by popping when size > k.

Quickselect: partition around a pivot, recurse only on the side containing kth element.

Min-heap: O(n log k). Quickselect: O(n) average, O(n²) worst.