Raymond Toy <toy(a)rtp.ericsson.se> writes:
Some discussions in comp.lang.lisp (or scheme?) mentioned that even
though tail-recursion is equivalent to iteration, it still takes a
toll on speed. 20% maybe or more? I don't remember the numbers from
the tests that were done.
That may be so in one particular implementation, but that would simply
mean that the implementor had not completed the tail optimizations.
Tail recursion can be equivalent to iteration. That doesn't mean that
everyone has done the optimizations perfectly.
--
Justin Sheehy
In a cloud bones of steel.