Re: For "speed freaks"

[Henrik Nordstrom]

MCENANEY WILLIAM J wrote:

> Since James is saying that recursive programs run slowly, I thought
> I would mention an article about stackless recursion.  If anybody
> wants a copy of it, I'll find the paper and e-mail you a copy.

If you are talking about transformin a recursive function to a loop then
I don't think this is called recursion anymore. Most recursive functions
can be transformed to loops, but many require some kind of stack to push
intermediade values on.

The reason why to use recursion is mostly simplicity. Certain kinds of
functions is very simple spelled out as a recursive function, and
complex when done non-recursive.

---
Henrik Nordström