英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

recursion    
递归,循环

递归,循环

recursion
递回

recursion
n 1: (mathematics) an expression such that each term is
generated by repeating a particular mathematical operation

Recursion \Re*cur"sion\ (-sh?n), n. [L. recursio. See {Recur}.]
The act of recurring; return. [Obs.] --Boyle.
[1913 Webster]

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)


请选择你想看的字典辞典：
单词字典翻译
Recursion查看　Recursion　在百度字典中的解释百度英翻中〔查看〕
Recursion查看　Recursion　在Google字典中的解释Google英翻中〔查看〕
Recursion查看　Recursion　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • Recursion - Wikipedia
    Recursion is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself A procedure that goes through recursion is said to be 'recursive' [3] To understand recursion, one must recognize the distinction between a procedure and the running of a procedure
  • Introduction to Recursion -
    Introduction to Recursion CS 106B: Programming Abstractions Fall 2025, Stanford University Computer Science Department Lecturer: Chris Gregg, Head CA: Yasmine Alonso Announcements Add drop deadline is on Friday – feel free to reach out to the course staff if you have any questions about the class going forward
  • Reading 10: Recursion - MIT
    Recursion – a method calling itself – is a special case of a general phenomenon in programming called reentrancy Reentrant code can be safely re-entered, meaning that it can be called again even while a call to it is underway
  • Recursion | Brilliant Math Science Wiki
    Recursion formalizes the process of recognizing how solutions to smaller cases of a problem can, layer by layer, be built up to solve any case of a problem, no matter how enormous Needless to say, it can be tricky to figure out how to solve infinitely many problems simultaneously That #x27;s what this wiki page will explain, so brace yourself for some problem solving that feels a bit loopy
  • Recursion - from Wolfram MathWorld
    A recursive process is one in which objects are defined in terms of other objects of the same type Using some sort of recurrence relation, the entire class of objects can then be built up from a few initial values and a small number of rules The Fibonacci numbers are most commonly defined recursively Care, however, must be taken to avoid self-recursion, in which an object is defined in





中文字典-英文字典  2005-2009