@sankalp how will you solve using count sort . I would like to have your solution :)
On Mon, Jan 31, 2011 at 6:53 PM, sankalp srivastava < richi.sankalp1...@gmail.com> wrote: > @manoj > the great recursion problem has the time complexity as > tn=2(T(n/2))+O(1) . It is not linear . > > ur algo is O(nlog n) > This can be possible using a counting sort (again , use Bitsets to > save ur space ) > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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.
