It took me seven comparisons, because I can take advantage of the fact I know I only ever have to look at the first element of each sub-list. Those are the only things I need to compare, and when I run out of one list, I just add the rest of the list in.

进行了7次对比，因为我可以利用我知道的优势：,每次只需要比较每个子列表的第一个元素,那才是我需要进行对比的内容,当一个列表的元素处理完了,只需要将另一个列表剩下的元素直接添加进去。

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

I just doubled the indentation each time so you can see it. So each successive call, notice what's happening. The argument is getting reduced. And we're going another level in. When we get down to this point, we're calling it with just a string of length one.

因此每次成功调用注意它的过程,我们的命题不断简化，而且我们不断深入嵌套,当我们走到这一步的时候,我们就是在调用它处理，仅有一个元素的字符串了。

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

If you go to the dining hall you know, the portions-- one person serves themselves this much of a food and another serves themselves another, and then when you go to a restaurant there are variations on how much you get served of things, and so it's very hard to estimate portions for people.

如果你去食堂,摄入量是指,一个人吃了自己的那部分食物,或其他人吃的他们的那一部分,当你去餐厅,每次吃多少是变化的,因此估算每个人的摄入量是很难的

耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选

So before long, we'll see, especially for problems that we can't allocate an int every time we want to store something, because what if we want to store 140,000 English words.

所以不久后，我们将看到，特别是对于,我们不能为int分配内存，每次我们想要,存储一些东西时，因为当我们想要,存储140，000个英语单词时。

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

b times. So I've got to go 3 b steps. All right I've got to go through the loop b times I've got three steps each time, and then when I pop out of the loop, I've got two more steps. All right I've got the initiation of answer and the return of it.

好，我一共执行了b次循环,每次循环内部进行了三次基本操作,当跳出循环后还有两个基本操作，因此这个初始的答案就是,2+3b次基本操作,来完成这个循环。

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