Re:How recursion got into programming: a comedy of errors
by theseoafs on Wednesday July 23, 2014 @09:51PM
(#8077869)
> Basicly, all recursion can be replaced by a loop that does not risk blowing the stack or using extra memory.
This isn't true at all. You can replace all recursion with loops, sure, but you're going to have to simulate a stack (i.e. use extra memory) to convert complex recursive functions to loops.
This isn't true at all. You can replace all recursion with loops, sure, but you're going to have to simulate a stack (i.e. use extra memory) to convert complex recursive functions to loops.