And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.

这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。

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

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交换,然后一次遍历，不会做任何事情。

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

It's as though I've walked across the stage like this realized, damn, it was the guy over here or rather I found the smallest element here who beat out number 2 over here so I can now put number 1 into place and recall that it didn't matte if I punted whoever was standing here 'cause they were given to me randomly anyway.

这就像是我这样走过讲台,然后才发现要找的人在那儿,或者说发现了最小的元素,那么就可以将1号放在正确的位置,而在这儿的是谁并不重要,因为他们本身就是,随机的。

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

The element is carbon. That is the smallest unit.

那个元素是碳，是最小的单位。

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

Smallest element at the front.

好的，最小的元素到前面了。

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

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.

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

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