Radix sort is independent of the range and only depends on the number of items.
here k=max value= n^3. since , radix sort is independent of k, so here also it sorts "n integers" in O(n). On Oct 2, 10:38 pm, "Harshal ..Bet oN iT!!" <[email protected]> wrote: > this theorem is true for comparision sorts only! counting sort is not a > comparison sort. -- 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.
