J
Jim Langston
I need some memory related information about recursion.
That is how it is implemented
AFAIK a recursive function isn't different than a non recursive function.
The function just calls itself like it could call any function pushing the
parameters onto the stack, in an implementation that uses a stack.
With enough recursion you can run out of stack space, which is why there's a
practicle limit to the number of times you can recurse.