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.

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

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

I've got to test to see if I'm in the base case, and if I'm not, then I need to move a tower of size n minus 1, I need to move a tower of size 1, and I need to move a second-sorry about that a second tower of size n minus 1.

首先我看看我是不是在最基本的情况，如果不是的话，我得先做一个N-1个，圆盘的移动，移动一个圆盘,然后再做一次N-1个圆盘的移动。

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