英文字典中文字典


英文字典中文字典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英翻中〔查看〕

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


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

































































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


  • What is recursion and when should I use it? - Stack Overflow
    Recursion is a tree, with branches and leaves, called parents and children respectively When you use a recursion algorithm, you more or less consciously are building a tree from the data
  • What are the advantages and disadvantages of recursion?
    With respect to using recursion over non-recursive methods in sorting algorithms or, for that matter, any algorithm what are its pros and cons?
  • Understanding how recursive functions work - Stack Overflow
    Recursion started making sense to me when I stopped reading what others say about it or seeing it as something I can avoid and just wrote code I found a problem with a solution and tried to duplicate the solution without looking
  • Convert recursion to iteration - Stack Overflow
    37 Strive to make your recursive call Tail Recursion (recursion where the last statement is the recursive call) Once you have that, converting it to iteration is generally pretty easy
  • java - What is recursion - Stack Overflow
    Recursion is a programming technique where a method can call itself as part of its calculation (sometimes you can have more than one method - the methods would then normally call each other circularly)
  • Is recursion ever faster than looping? - Stack Overflow
    Why? Because recursion is typically well founded over some data structure, inducing an Initial F-algebra and allowing you to prove some properties about termination along with inductive arguments about the structure of the (recursive) computation The process by which recursion is compiled to loops is tail call optimization





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