[Home] [By Thread] [By Date] [Recent Entries]
Sorry I am joining a bit late into this thread. Lot of good things have already been said about recursion. I think recursion is implemented (by compiler / interpreter / or, XSLT processor) using some kind of stack. 1) Each time a method is called, the method is pushed on the stack. 2) Each time the method returns, the method is popped off the stack. 3) If a method calls itself recursively, another copy of the method is pushed onto the stack. If you understand how stack works, you can easily visualize recursion. On 3/22/07, Rashmi Rubdi <rashmi.sub@xxxxxxxxx> wrote: Nice post. -- Regards, Mukul Gandhi
|

Cart



