David Brown([EMAIL PROTECTED])@Thu, Jan 24, 2008 at 11:34:00AM -0800: > On Thu, Jan 24, 2008 at 11:13:00AM -0800, [EMAIL PROTECTED] wrote: > >On Thu, Jan 24, 2008 at 11:06:52AM -0800, SJS wrote: > >>Iteration is fast. > >>Recursion is elegant. > > > >I like this. > > And, in Scheme, you get both. Even better. >
So, now that I understand this a _little_ better, how does scheme compare to common lisp in regard to optimizing tail recursion? Is tail recursion as efficient as iteration in CL? My grasp of tail recursion is far from solid. I haven't been able to go through the SICP course for lack of time. One of the earlier posts said something about it being important to distinguish tail recursion from other recursion. Is this something that is easy to get wrong? What would the pitfalls be? Wade Curry syntaxman -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
