Well if you think about these steps, here's an easy way to do it. Let's start at 1.

如果你要考虑步骤的话，这里有个简单的方法，让我们从第一步开始。

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

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.

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

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