Seems correct to me :) Anurag Sharma
On Sun, Jun 13, 2010 at 11:23 PM, amit <[email protected]> wrote: > Can anyone tell what is Stack Space required for Quick Sort and Merge > Sort.And how in each case it can be modified. > > Correct me if I am wrong on this. > Space Complexity of Merge Sort ( Not Inplace) - O(n) > Space Complexity of Quick Sort - O(1) > > -- > 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]<algogeeks%[email protected]> > . > 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 [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.
