Hi all,
Please correct me if I am wrong. Since quick sort is in-place
sort, there is no difference in stack space whichever order you do it. In
the worst case the stack depth can be O(n) unless you convert the quick sort
of longer sub-array to iteration instead of recursion in which case the
recursion depth is always O(logn).
On Sat, Jun 5, 2010 at 7:13 AM, sharad kumar <sharad20073...@gmail.com>wrote:
> @divya,in second case longer one will be in stack for shorter time(not
> longer)bcoz it will take less time to sort small sequence so stack space for
> shorter one will be freed earlier,otherwise that space has to wait for the
> longer time
>
> --
> 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.
>
--
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.
