对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。

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.

youdao

递归实际上是定义一个调用自身的函数的方式。

Recursion is actually a way of defining functions in which the function is applied inside its own definition.

youdao

这种查找是递归的：如果 在 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.

youdao