Give a randomized algorithm with expected time complexity O(n) for finding the median element in an array of n integers where all elements are distinct. (Hint: solve the general problem of finding k-th smallest element for any given k. Recall randomized quicksort.)