The best thing is that you don't need explicit stacks for removing recursion. A couple of loops can do the job.
On Aug 6, 9:57 pm, immanuel kingston <[email protected]> wrote: > Yes. just remove the recursive part using 2 stacks. > > Thanks, > Immanuel > > On Fri, Aug 5, 2011 at 6:51 PM, Nitin Nizhawan > <[email protected]>wrote: > > > > > does anyone know of any in-place, iterative mergesort algorithm with nlogN > > worst case complexity? It would be good if it is stable also. > > > TIA > > Nitin > > > -- > > 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. -- 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.
