catflap.org Online Dictionary Query

  recursion
       
           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 \Re*cur"sion\ (-sh?n), n. [L. recursio. See Recur.]
     1. The act of recurring; return. [Obs.] --Boyle.
        [1913 Webster]
  
     2. (Math.) The calculation of a mathematical expression (or a
        quantity) by repeating an operation on another expression
        which was derived by application of the same operation, on
        an expression which itself was the result of similar
        repeated applications of that same operation on prior
        results. The series of operations is terminated by
        specifying an initial or terminal condition.
        [1913 Webster]
  
     3. (Computers) A programming technique in which a function
        calls itself as a subfunction. Such calls may be repeated
        in series to arbitrary depth, provided that a terminating
        condition is given so that the final (deepest) call will
        return a value (rather than continue to recurse), which
        then permits the next higher call to return a value, and
        so forth, until the original call returns a value to the
        calling program.
        [1913 Webster]

  recursion n. See recursion. See also tail recursion.
  
  

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

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

  recursion
     Αγγλικά n.
     ({{ετ|μαθ|en|0==

  recursion
     n.
     1 The act of recurring.
     2 (lb en mathematics) The act of defining an object (usually a
  function) in terms of that object itself.
     3 (lb en programming) The invocation of a procedure from within
  itself.

  recursion
     n.
     1 The act of recurring.
     2 (lb en mathematics) The act of defining an object (usually a
  function) in terms of that object itself.
     3 (lb en programming) The invocation of a procedure from within
  itself.

  recursion
     n.
     1 The act of recurring.
     2 (lb en mathematics) The act of defining an object (usually a
  function) in terms of that object itself.
     3 (lb en programming) The invocation of a procedure from within
  itself.

  recursion
     n.
     1 The act of recurring.
     2 (lb en mathematics) The act of defining an object (usually a
  function) in terms of that object itself.
     3 (lb en programming) The invocation of a procedure from within
  itself.

  recursion
     Englanti n.
     rekursio

  recursion
     Engelska n.
     (tagg språk=en matematik) rekursion

  Recursion /ɹɪkˈɜːʃən/
  استدعاء ذاتي

  recursion /ɹɪkˈɜːʃən/ 
  rekurze

  recursion /ɹɪkˈɜːʃən/
  Rekursion 
   see: recursions, recurse
  

  recursion //ɹɪˈkɜː(ɹ)ʒən// 
  1. rekursio
  in mathematics
  2. rekursio, toisto, uusinta
  the act of recurring

  recursion /ɹɪkˈɜːʃən/
  recursivitate

  recursion //ɹɪˈkɜː(ɹ)ʒən// 
  rekursion
  in mathematics

  循环

     递归,循环