All right. That actually seems like a really nice thing to have, and so let me show you what that would basically look like.

好了，那真的像一个,可以拥有的好事情，所以让我来给你们演示,那基本会是什么样子。

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

Anything you can do with one, you can do with another it's based on that fundamental result.

你用一种语言做的事情，也可以用另一种做,这是基于那个基本结果之上的。

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

Because one of the things that you want to do as a good designer is to basically map a new problem into a known domain.

因为如果你们,想做一个好的设计师,最基本的事情之一就是学会,把没碰到过的问题映射到已经领域中去。

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

Second thing we saw was, we saw that associated with every primitive value was a type.

我们学习到的第二件事情是，和每个基本值对应的,是一个类型。

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

Second thing we've got to worry about is, what's a basic step? All right, if I bury a whole lot of computation inside of something, I can say, wow, this program, you know, runs in one step. Unfortunately, that one step calls the Oracle at Delphi and gets an answer back. Maybe not quite what you want.

我们需要担心的第二件事情就是，什么该作为一个基本的步骤呢？,如果我把一大堆的计算过程放到里面，我可以说，噢，这个程序你知道的，一步就完成了，不幸的是,这一步可能要靠预言家才能得到答案,这可能跟你想要的结果不太相同吧。

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

So we're to assume we can get to any piece of data, any instruction in constant time, and the second assumption we're going to make is that the basic primitive steps take constant time, same amount of time to compute. Again, not completely true, but it's a good model, so arithmetic operations, comparisons, things of that sort, we're all going to assume are basically in that in that particular model.

因此如果我们假设在恒定的时间内,我们可以取得任何一块数据,任何一种数据结构的话,我们要做的第二个假设就是,基本的原始操作计算花费的时间是恒定的,这个假设也不是完全正确的，但这个模型其实挺不错的，因此算法操作，比较，这一类的事情，我们在这个特定的模型中都假设是基本的,操作，花费的时间是恒定相同的。

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

I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

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