recently that would have been improved
in one place by its use.
But I still have a question :). As I understand it when tail-call
optimization is done automatically there are two advantages. One is
that the stack doesn't grow out of control, so that you don't have to
worry about blowing it up
have been improved in one place by its use.
But I still have a question :). As I understand it when tail-call
optimization is done automatically there are two advantages. One is that the
stack doesn't grow out of control, so that you don't have to worry about
blowing it up if you recurse very
From: Tagore Smith [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject:Tail call optimization
Date sent: Tue, 28 May 2002 23:42:30 -0400
I came across this statement on the web:
Perl ... supports the tail-call optimization
I came across this statement on the web:
Perl ... supports the tail-call optimization (although you have to do it by
hand).
I was wondering if someone could give me an example of this. I know what
tail-call optimization means, and how to write tail-recursive functions, in
Lisp- just not sure
