🚀 go-pugleaf

    In article <AD87DB279668D9F74@mcdiala15.it.luc.edu>
    VArase@varase.it.luc.edu "Verne Arase" writes:
    >> Recursion can make for visually appealing and simplified code,
    >> but in real terms they're nothing but trouble unless you can
    >> absolutely positively guarantee a finite, known level stack
    >> depth.

>>>>> "Lawrence" == Lawrence Kirby <fred@genesis.demon.co.uk> writes:
    Lawrence> An O(log N) stack depth is generally not a problem. I
    Lawrence> guess you could say that is finite because there are
    Lawrence> typically practical upper bounds to N.

Tail recursion is implemented by all non-stupid compilers the same way
as the imperative (goto) version.  Gcc will do this, whether or not
your favorite compiler will is a different matter.

No stack problems at all.

Kelly