| 释义 |
recursion
re·cur·sion R0094400 (rĭ-kûr′zhən)n.1. 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.2. 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.
[Late Latin recursiō, recursiōn-, a running back, from Latin recursus, past participle of recurrere, to run back; see recur.]recursion (rɪˈkɜːʃən) n1. the act or process of returning or running back2. (Logic) logic maths the application of a function to its own values to generate an infinite sequence of values. The recursion formula or clause of a definition specifies the progression from one term to the next, as given the base clause f(0) = 0, f(n + 1) = f(n) + 3 specifies the successive terms of the sequence f(n) = 3n3. (Mathematics) logic maths the application of a function to its own values to generate an infinite sequence of values. The recursion formula or clause of a definition specifies the progression from one term to the next, as given the base clause f(0) = 0, f(n + 1) = f(n) + 3 specifies the successive terms of the sequence f(n) = 3n[C17: from Latin recursio, from recurrere recur] reˈcursive adjThesaurus| Noun | 1. | recursion - (mathematics) an expression such that each term is generated by repeating a particular mathematical operationformula, rule - (mathematics) a standard procedure for solving a class of mathematical problems; "he determined the upper bound with Descartes' rule of signs"; "he gave us a general formula for attacking polynomials"math, mathematics, maths - a science (or group of related sciences) dealing with the logic of quantity and shape and arrangement |
Translations
recursion
recursion[ri′kər·zhən] (computer science) A technique in which an apparently circular process is used to perform an iterative process. recursion (mathematics, programming)When a function (or procedure)calls itself. Such a function is called "recursive". If thecall is via one or more other functions then this group offunctions are called "mutually recursive".
If a function will always call itself, however it is called,then it will never terminate. Usually however, it firstperforms some test on its arguments to check for a "base case"- a condition under which it can return a value withoutcalling itself.
The canonical example of a recursive function isfactorial:
factorial 0 = 1factorial 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.recursionIn 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.recursion Related to recursion: recursion formula, Tail recursion
recursion is not available in the list of acronyms. Check:- general English dictionary
- Thesaurus
- encyclopedia
- Wikipedia
recursion
Related to recursion: recursion formula, Tail recursionWords related to recursionnoun (mathematics) an expression such that each term is generated by repeating a particular mathematical operationRelated Words- formula
- rule
- math
- mathematics
- maths
|