##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Finding rank k
Given an array, find the k-th largest (or smallest) element. Approaches:
Sort: time, extra space.
Min-heap of size : time, space.
Quickselect: average, worst. The heap approach is effective and reliable. For k-th largest, maintain a min-heap of the largest elements seen so far.
