On Sat, Jan 26, 2008 at 12:20:31PM -0800, Wade Curry wrote: > 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?
Tail recursion doesn't blow your stack. If your type of recursion isn't tail recursion your Scheme interpreter may crash from lack of memory. http://en.wikipedia.org/wiki/Tail_recursion has a good example of factorial functions that are and aren't tail recursive. Chris -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
