tail recursion

Definition from Wiktionary, a free dictionary

[edit] English

[edit] Noun

tail recursion (plural tail recursions)

1. (computing) The technique of writing a function so that recursive calls are only done immediately before function return, particularly when recursive control structures are used in place of iterative ones.

[edit] See also

• recursion
• tail recursive