An in place algorithm is one which only uses a constant amount of extra memory.
So recursion is a problem as it will use an implicit stack of size O(n) which is linear extra memory, not constant. On 7 October 2011 15:16, .itoa <nitm...@gmail.com> wrote: > But , let's say if we do by recursion , then could you explain the way it > would work ? > And this in-place keyword is not clear to me. Does it mean we can't use > buffer / temporary variables or something else? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/IW6-aiJabGAJ. > > 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.
