tail recursion

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

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.

See also[edit]