All right? And I'm going to say-- sort of set that stage here, so that-- It turns out that that's probably about the best we can do, or again ends at the length of the list.

我要说的是，这一阶段的集合,我们用最优的方法完成,还是取决于列表的长度，好的，还是回到了我的问题上了。

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

Some of which I built: cmp, init, str. And there, notice, are the internal definitions And in fact I should've said, we often call those things fields.

就是给我一个所有东西的列表：,所有的方法，与这个类关联的，有一些是我写的：,还有这里，请注意，是一些内部的定义。

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

I still have to do this process and here is where the finger thing gets a little more useful 'cause I have longer lists.

我仍需要进行这一步骤,在这儿手指的方法就比较有用，因为,列表比之前的要长。

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

So to just preface what we're going to do next time, what would happen if I wanted to do sort, and rather than in sorting the entire list at once, I broke it into pieces, and sorted the pieces, and then just figured out a very efficient way to bring those two pieces and merge them back together again?

所以为了引导下一次,我们要讲的内容,如果我想做排序,而且不是一次吧整个列表排完,会发生什么，我把它拆成小的列表,然后把各个小列表排序,接着用高效的方法再把小的列表？

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