Yes. just remove the recursive part using 2 stacks. Thanks, Immanuel
On Fri, Aug 5, 2011 at 6:51 PM, Nitin Nizhawan <nitin.nizha...@gmail.com>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 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. > -- 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.
