- Mathematics a. 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.b. A set of objects so defined.c. A rule describing the relation between an object in a recursive sequence in terms of the preceding objects.
- Linguistics 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.
Origin of recursionLate Latin recursiō, recursiōn-, a running back, from Latin recursus, past participle of recurrere, to run back; see recur.
- The act of recurring.
- (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.
- (computing) The calling of a function from within that same function.
- This function uses recursion to compute factorials.
From Latin recursiÅ (â€œthe act of running back or again, returnâ€), from recurrÅ (â€œrun back; returnâ€), from re- (â€œback, againâ€) + currÅ (â€œrunâ€).
recursion - Computer Definition
In programming, the ability of a subroutine or program module to call itself. It is helpful for writing routines that solve problems by repeatedly processing the output of the same process. See recurse subdirectories.