The best way to see why stacks are needed is to look at recursive functions. For simplicity, let's look at the recursive implementation of the factorial function.
了解为什么需要堆栈的最好方法是查看递归函数的情况。
Otherwise, a recursive function is used to calculate the factorial.
否则，使用递归函数计算阶乘。
This functionality works well as a recursive application, as shown in the sample factorial function in Listing 4.
这个功能作为递归应用程序工作良好，如清单4中的样本阶乘函数所示。
This functionality works well as a recursive application, as shown in the sample factorial function in Listing 4.
这个功能作为递归应用程序工作良好，如清单4中的样本阶乘函数所示。
应用推荐