tail recursion

(programming)When the last thing a function (or procedure)does is to call itself. Such a function is called tailrecursive. A function may make several recursive calls buta call is only tail-recursive if the caller returnsimmediately after it. E.g.

f n = if n < 2 then 1 else f (f (n-2) + 1)

In this example both calls to f are recursive but only theouter one is tail recursive.

Tail recursion is a useful property because it enables tail recursion optimisation.

If you aren't sick of them already, see recursion and tail recursion.

单词	tail recursion
释义	tail recursion tail recursion (programming)When the last thing a function (or procedure)does is to call itself. Such a function is called tailrecursive. A function may make several recursive calls buta call is only tail-recursive if the caller returnsimmediately after it. E.g. f n = if n < 2 then 1 else f (f (n-2) + 1) In this example both calls to f are recursive but only theouter one is tail recursive. Tail recursion is a useful property because it enables tail recursion optimisation. If you aren't sick of them already, see recursion and tail recursion.
随便看	a penny-dreadful a penny for them a penny for your thoughts a penny saved is a penny earned a penny saved is a penny gained a pen pusher a pen-pusher apenrade apens apenteric apeo apeoesp apeo-i apeo-l ape (one's) behavior a people person a people's republic ape our behavior ape our behaviour apep apepcy apepdcl ateliosis ateliotic ateliotic dwarf