So wherever the largest element started out in the list, by the time I get through it, it's at the end.

所以无论最大的元素,在列表的什么位置。

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

How could I possibly do it in sublinear time, I've got to look at least every element once.

我每个元素都至少得看一次，这就是我希望你们能够考虑的本质。

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

And this will have to go up before The International Union of Pure and Applied Chemistry before they approve it because they fought over element 106 for the longest time, but I think this will go through fairly quickly.

但还是要往上申请,直到国际纯粹与应用化学联合会,因为同意,他们为106号元素抗争了很久，但我想这个应该会很快通过。

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

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?

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

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

That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.

所以让我们来思考一会,要在线性时间能排序，列表里每个元素最多被使用常数次,不一定是一次，对吧。

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

That is basically saying, given some collection of data, I want to have again a looping mechanism, where now my process is, walk through this, the collection one element at a time. And for that, we have a particular construct, called a FOR loop.

现在我的过程就是,通过一个个访问这个集合中,的元素的方式，来遍历这个集合,为了达到这个目的，我们有一个特定的结构，成为FOR循环。

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