But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.

就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。

麻省理工公开课 - 计算机科学及编程导论课程节选

This is another way of doing exponentiation, but this one's a recursive function. All right?

但这是一种递归的方法对不对？,好，让我们看看这种方法？

麻省理工公开课 - 计算机科学及编程导论课程节选

Nobody in their right mind actually implements a recursive Fibonacci the way I did it originally.

没有谁真的在右脑中,按我最初讲的递归方法,计算Fibonacci数列。

麻省理工公开课 - 计算机科学及编程导论课程节选