tail recursion

English

Noun

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

writing a function so that recursive calls are only done immediately before function return

• Finnish: häntärekursio
• (deprecated template usage) {{trans-mid}}
• Japanese: 末尾再帰 (まつびさいき, matsubisaiki)

See also

• recursion
• tail recursive