In week zero, when we tore the phonebook in half and half and half we were recursing through that problem.

当我们将电话簿划分为一半又一半的时候,其实就是利用递归在解决问题。

哈佛公开课 - 计算机科学课程节选

I have used divide and conquer, as we seen before, to recursively break it into smaller problems. But the smaller problem of fib of 4 and the smaller problem of fib of 3 overlap with each other.

正如我们之前看到的，我已经进行了划分,并且递归性的把它分解为更小的问题,但是fib的简化问题,和fib的简化问题会相互重叠。

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