QuickSelect Select the k-th small (large) data from the set of n elements. This is in-place algorithm. Time complexity : $O(n)$