@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 [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.
