convert all numbers to base n since every number is between 1 and n^2 every number would have 2 digits this can be done in O(n) since for each number we need only one division so we have n numbers with 2 digits each digit between 0 and n-1 using radix sort this array can be sorted in O(n)
-- 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.
