Printer Friendly
Dictionary, Encyclopedia and Thesaurus - The Free Dictionary
3,591,936,822 visitors served.
forum Join the Word of the Day Mailing List For webmasters
?
Dictionary/
thesaurus
Medical
dictionary
Legal
dictionary
Financial
dictionary
Acronyms
 
Idioms
Encyclopedia
Wikipedia
encyclopedia
?

tail recursion

   Also found in: Wikipedia 0.03 sec.
(programming)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.


How to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit webmaster's page for free fun content.
?Page tools
Printer friendly
Cite / link
Feedback
Mentioned in?  References in periodicals archive?   Encyclopedia browser?   Full browser?
No references found
 
MMX Optimizations Enhance Performance CAD-UL has implemented these and other optimizations in its x86 C++ compiler in order to set standards for C++ code efficiency: --Front-End Optimizations--Exercise constant propagation, strength reduction, common sub-expression elimination, loop unrolling, tail recursion, and more.
 
 
 
Encyclopedia
?

Terms of Use | Privacy policy | Feedback | Copyright © 2012 Farlex, Inc.
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.