tail recursion

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Noun[edit]

tail recursion (countable and uncountable, plural tail recursions)

  1. (programming) 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.

Translations[edit]

See also[edit]