Author: Dan Andersson
Date: 07:29:51 04/10/04
Go up one level in this thread
There are reasons for using recursion. One of them is that the generated code tends to be smaller. And that could trumph any gains made from reducing the data. Another one is decreasing complexity. And the ability to use induction to prove an algorithm. I often use tail recursion as a goto with values. It usually doesn't incur any overhead. And increases branch prediction for some types of code like parsers, regexp and interpreters. MvH Dan Andersson
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.