英文字典中文字典51ZiDian.com
|
|
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] 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)
请选择你想看的字典辞典：
|
安装中文字典英文字典查询工具!
英文字典中文字典相关资料:
|
中文字典-英文字典 2005-2009