So, if I've got positive charge uniformly distributed, look at the choice. It's a brilliant experiment.

所以如果按照正电荷是均匀分布的假设来说，就会是这样的，这是一个聪明的实验。

麻省理工公开课 - 固态化学导论课程节选

I've got a list, walk you through it an element at a time, do I look at each element of the list more than once?

你一次只能得到他的一个元素,我是不是把数组里面的每个元素，都过了大于等于一次？,你不这样认为么？大家有什么建议？

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

Hmm. Well, wait a minute. If I want to sort a list, I'll take one element, I've got to look at probably a lot of the other elements in the list in order to decide where it goes. And that suggests it's going to depend on how long the list is.

我会取一个元素，然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对，这没什么说服力，但是事实上。

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

Basic idea, before I even look at the code, is pretty simple. If I've got a list that is sorted, in let's call it, just in increasing order, and I haven't said what's in the list, could be numbers, could be other things, for now, we're going to just assume they're integers.

我们可以说基本的思想是很简单的,如果我有一个排好序的数组，让我们认为这个数组是递增的吧，我并没说数组里元素是什么，可能是数字，也可能是其他的东西，现在我们假设是integer类型的数字吧，最简单的方式就是这么做了：

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