Search: in
Tail recursion
Tail recursion in Dictionary Dictionary
  Tutorials     Encyclopedia     Videos     Books     Software     DVDs  
       
Dictionary results for: Tail recursion

Tail recursion


Tail recursion

Tail recursion




Source: The Jargon File (version 4.4.7, 29 Dec 2003)

	tail recursion
 n.

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

	




Source: The Free On-line Dictionary of Computing (26 July 2010)

	tail recursion

    When the last thing a function (or procedure)
   does is to call itself.  Such a function is called tail
   recursive.  A function may make several recursive calls but
   a call is only tail-recursive if the caller returns
   immediately 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 the
   outer 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.

   [Jargon File]

   (2006-04-16)

	

Matching Word(s)
Tail

recursion





Search Dictionary :



Search   in  
Search for Tail recursion in Tutorials
Search for Tail recursion in Encyclopedia
Search for Tail recursion in Videos
Search for Tail recursion in Books
Search for Tail recursion in Software
Search for Tail recursion in DVDs
Search for Tail recursion in Store





Powered by dict.org
Advertisement




Tail recursion in Dictionary
Tail recursion top Tail recursion

Home - Add TutorGig to Your Site - Disclaimer

©2011-2013 TutorGig.info All Rights Reserved. Privacy Statement