right-linear recursion 右线性递归
Usually, return address must be saved for continuing a right execution of the program in no recursion version.
通常,非递归算法要保存返回地址,使程序能继续正确执行。
All right, I want to show you one last example of using recursion because we're going to come back to this. This is a classic example of using recursion. And that is dating from the 1200s and it is due to Fibonacci.
并且返回答案,我想给你看看递归的最后一个例子,因为我们还要再看一遍,这是一个递归的经典案例,它可以追溯到13世纪。
应用推荐