|
 Definitions for recursion: The Collaborative International Dictionary of English v.0.48
:
Recursion \Re*cur"sion\ (-sh?n), n. [L. recursio. See Recur.]
The act of recurring; return. [Obs.] --Boyle.
[1913 Webster]
WordNet (r) 2.0
:
recursion
n : (mathematics) an expression such that each term is generated
by repeating a particular mathematical operation
Jargon File (4.3.1, 29 Jun 2001)
:
recursion n. See recursion. See also tail recursion.
The Free On-line Dictionary of Computing (27 SEP 03)
:
recursion
When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
calling itself.
The canonical example of a recursive function is
factorial:
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.
[Jargon File]
(1996-05-11)
Related SitesRecursion - Wikipedia, the free encyclopedia
A visual form of recursion known as the Droste effect. Recursion, in mathematics and computer science, is a method of defining ...
Recursion (computer science) - Wikipedia, the free encyclopedia
Recursion in computer science is a way of thinking about and solving ... 2.1 Examples of recursively defined procedures (generative recursion) 2.1.1 Factorial ...
recursion: Definition from Answers.com
recursion n. Mathematics. An expression, such as a polynomial, each term of which is determined by application of a formula to preceding terms
Cprogramming.com Tutorial: Recursion
Cprogramming.com recursion tutorial. Explains recursion and how to use it in programs. ... Recursion is a programming technique that allows the programmer to express ...
recursion
Recursion is a fundamental concept in mathemetics and computer science and many ... An essential ingredient of recursion is there must be a "termination condition" ...
Java Recursion with examples
The case in which we end our recursion is called a base case. ... Thus, the code of the method actually has the solution on the first recursion. ...
|
