with a data structure, you can definitely achieve O(N) where N != kN, N is the length of the number.
On Oct 2, 1:02 pm, "Harshal ..Bet oN iT!!" <hc4...@gmail.com> wrote: > you are given n integers in the range 0 to n3-1 ((n to the power 3) - 1) . > how can u sort the numbers 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.
