单词recursive-function
网络: 递归函数；递回函数；递回函式
Probably the best way to understand is with a real example and to do that, we need a recursive function.
可能理解它的最佳途径是接触一个实际的例子，我们需要一个递归函数。
When we converted our loop to a recursive function, the recursive call was the last thing that the function did.
当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。
Let"s take a look at a common loop for printing reports and see how it can convert into a recursive function.
让我们来研究一个打印报表的常见循环，了解如何将它转化为一个递归函数。
Our next example of a recursive function on lists will be a little more complicated.
我们的下一个基于列表的递归函数示例要稍微复杂一些。
The steps required to write such a recursive function are listed below, and Listing 3 presents the source code of the function itself.
编写这种递归函数需要执行的步骤如下所示，清单3给出了这个函数的源代码。
You need to do this because your parameter will get clobbered on the recursive function call, and you will need access to it afterwards.
之所以需要这么做是因为参数会在递归函数调用上被截断，而以后却还需要访问它。
However, for clarity, the example below is not created as a recursive function.
然而，为清楚起见，没有将下面的示例创建为递归函数。
Given that everyone else uses factorial, we"ll use a simpler recursive function that sums up a sequence.
有人用阶乘描述它，而我们将使用更简单的递归函数--对一个列表求和。
A Recursion is a type of Message used in Sequence diagrams to indicate a recursive function.
Recursion是序列图中一种用来表示递归函数消息的类型。
main is a recursive function -- it accepts a node set in the current argument and loops over the node set.
main是一个递归函数，它用current参数接受一个节点集并遍历该节点集。