tail recursion

English

Noun

tail recursion (countable and uncountable, plural tail recursions)

(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

Japanese: 末尾再帰 (まつびさいき, matsubisaiki)

See also

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.