Constructing an algorithm to find the smallest log(log(n)) elements from an array of length n
I am a math student and I have been asked to help grade answer sheets for an Algorithms course as one of my professors is unwell. While I am quite familiar with combinatorial algorithms, I am not well versed in sorting/searching algorithms. One of the problems that has been asked is this one.