the problem statement doesn't seem to be true. there's no surety that you can see all the questions within a certain no. of clicks.. it all depends on the randomness of the algorithm that picks the random question. somebody correct me if i'm wrong.
On Jul 22, 5:39 pm, akash <[email protected]> wrote: > A website has n questions. If you're shown one random question per > click, prove that it takes O(n log n) clicks on avg to see all > questions. > > How should I approach this problem. This sounds easy but till now I am > not able to get any headway. Any help is appreciated. Thanks. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
