You are given an array A of n distinct numbers A = [a1, a2, ... , an]

Provide an O(n) algorithm that returns the 3rd, 4th, and 5th smallest numbers in that array.

More generally, provide an O(n) algorithm that returns all the order statistics between i and j, where i < j (3 to 5 in this case)

I know that you can use the randomized quicksort but