Last modified on 18 April 2014, at 02:24

tail recursion

EnglishEdit

NounEdit

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 alsoEdit