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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
