@Gopi: Explain how a counting sort can be done without zeroing out an array of size n^3, and then scanning it, or explain how to do these operations in O(n).
Dave On Aug 14, 10:52 am, "*$*" <gopi.komand...@gmail.com> wrote: > if extra space is allowed .. can use counting sort > > > > > > On Sun, Aug 14, 2011 at 8:38 PM, Ankur Garg <ankurga...@gmail.com> wrote: > > This is one question from Coreman > > > 3rd Edition - > > > 8-3-4 -- Sort n integers in the range 0 to n^3 -1 in O(n) time > > > Any ideas how to do this 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 algogeeks@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. > > -- > Thx, > --Gopi -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
