You are given an unordered sequence of n integers with many duplications, such that the number of distinct integers in the sequence is O(log n). Design a sorting algorithm and its necessary data structure(s), which can sort the sequence using at most O(n log(log n)) time.
Give the detailed design. -- 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.
