QuickSelect: to find the kth smallest element in O(n)-Best & Average case time complexity. The worst case => O(n^2) since quick select uses partition method of quick sort. To assure Worst Case => O(n) can be achieved by Median of Median Algorithm.