The second question I want to ask is what's the base case? When do I get down to a problem that's small enough that it's basically trivial to solve? Here it was lists of size one. I could have stopped at lists of size two right. That's an easy comparison.

第二个问题是什么是基础条件？,我要将问题分解到何时才使得问题,小到可以解决的基本问题？,这里是当列表的长度为1有时候,我也可以在长度为2的时候停止分解,那是一个非常简单的对比。

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

Well, realize one of the themes in this course and really one of the themes in programming and solving any problem with a machine is going to be really to just take small bites one at a time out of these problems until the end result ultimately is that you've actually bitten off a fairly large fairly interesting problem and in the aggregate, you've actually implemented something pretty sophisticated.

好吧，让我们先想一下这件事带给我们的主题,编程和解决问题的思想,一台机器最开始只会一步一个脚印,沿着要解决的问题向前迈进,直到最终的结果出来,最后你会发现，你已经解决了一个相当大,相当有趣的问题，而这个问题在最初看起来确是相当复杂的。

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