Tail recursion

This is an old revision of this page, as edited by Aschlafly (talk | contribs) at 23:08, September 29, 2007. It may differ significantly from current revision.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Tail recursion is a particular type of recursion in which the last operation of a function is a recursive call.

Optimization of this type of recursion can be done by executing the call in the current stack frame and returning its result, instead of creating a new stack frame.