any type of replace would need at least one extra memory space. recursion is the worst, depends how you implement recursion. one iteration might depends on another, which depends one other, and so on...... each iteration hold its own "stack"
On Sep 23, 1:59 pm, Albert <[email protected]> wrote: > How to reverse a String using recursion in C without using any extra > memory? > > the question seems to be simple..... > > char* strrev(char *) > { > ... > ... > ... > > } > > Try to give all the answers for this prototype..... -- 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.
