# Recursion meaning

A set of objects so defined.

noun

The property of languages in which a structure, such as a phrase or clause, may form a part of a larger structure of the same kind, allowing for a potentially infinite variety of constructions.

noun

A method of defining a sequence of objects, such as an expression, function, or set, where some number of initial objects are given and each successive object is defined in terms of the preceding objects. The Fibonacci sequence is defined by recursion.

noun

A rule describing the relation between an object in a recursive sequence in terms of the preceding objects.

noun

A generating of the next number or result in a series by reapplying the algorithm on which the series is based to the number or result in the series that preceded it.

noun

Advertisement

In programming, the ability of a subroutine or program module to call itself. Recursion is used to write routines that solve problems by repeatedly processing the output of the same process. See recurse subdirectories, circular reference and recursive descent parser.

(mathematics) The act of defining an object (usually a function) in terms of that object itself.

N! = n Ã— (n âˆ’ 1)! (for n > 0) or 1 (for n = 0) defines the factorial function using recursion.

noun

(computing) The calling of a function from within that same function.

This function uses recursion to compute factorials.

noun

### Origin of recursion

From Latin

*recursiÅ*(“the act of running back or again, return"), from*recurrÅ*(“run back; return"), from*re-*(“back, again") +*currÅ*(“run").