对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
递归实际上是定义一个调用自身的函数的方式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
这种查找是递归的：如果在prototype 内定义的实例不能找到属性或函数，它就会在其原型中查找，依此类推。
This lookup is recursive: if the instance defined in prototype cannot find an attribute or function, it will look in its prototype, and so on.
在围绕g _ range参数所定义的全部可能范围构建签名时，check_dynamics函数将递归调用自身。
The check_dynamics function recursively calls itself while building signatures encompassing the full range of possibilities defined by the g_range parameter.
为了避免无限递归，Scala要求每一个辅助构造函数调用在它之前定义的构造函数[ScalaSpec2009]。
In order to avoid infinite recursion, Scala requires each auxiliary constructor to invoke another constructor defined before it [ScalaSpec2009].
设计并实现了一个面向教学的类c编译器，支持全局或局部变量的定义、函数参数传递和函数递归调用。
Designing and implementing a teaching-oriented C-like compiler, which supports the definition of local and global variables, function parameters, as well as recursive call of functions.
递归原语函数是递归函数定义的一个子类。
Primitive recursive functions are a naturally defined subclass of the recursive functions.
递归原语函数是递归函数定义的一个子类。
Primitive recursive functions are a naturally defined subclass of the recursive functions.
应用推荐