But guys, if you have O(n^2) space, it's unlikely you'll come up with an O(n) algorithm because just initializing the memory takes longer. (Note there are a few algorithms that actually can use space without initializing it, but probably not for sorting.)
On Jul 10, 10:27 am, jalaj jaiswal <jalaj.jaiswa...@gmail.com> wrote: > take auxillary array O(n^2) space .. will it do.. or are there some more > constraints ?? > > On Sat, Jul 10, 2010 at 1:25 AM, Devendra Pratap Singh < > > dpsingh.ii...@gmail.com> wrote: > > plz write a code to > > > Sort n integer in the range 1 to n^2 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<algogeeks%2bunsubscr...@googlegroups > > .com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > With Regards, > Jalaj Jaiswal > +919026283397 > B.TECH IT > IIIT ALLAHABAD -- 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.
