So we'll put one as the first element, maybe a is the second element.

可能a可以作为第二个元素，然后第三个元素也是1，然后返回。

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

OK. The next largest element has to end up in the second last spot. Et cetera. All right, so it's called bubble sort because it does this bubbling up until it gets there.

好的，下一个最大元素又,能跑到倒数第二的位置，等等如此，好的，这称为冒泡排序,因为这个泡泡一直冒到他自己的位置。

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

In the second case, I found in the next smallest element and moved here, taking what was there and moving it on, in this case I would swap the 4 and the 8, and in next case I wouldn't have to do anything.

在第二次遍历中，我找到了,第二小的元素，把它移到这里,把这里原来的元素移到哪里,在这一次遍历中，我会把8和4交换,然后一次遍历，不会做任何事情。

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

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.

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

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

All right, I've got to do one pass to bubble the last element to the end. I've got to do another pass to bubble the second last element to the end.

好的，我要冒一次泡来,把最大的元素冒到最后去,我还得再冒一次泡来吧第二大的元素。

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