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.

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

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

And this would point to value, and this would point off someplace in memory.

需要多少个基本内存块，然后我就得知下一个元素的位置了。

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

So the first one here is something called insertion sort which amounts to going through the list, taking the first thing that you see and inserting that element into its correct place, - then moving on to the next one, dealing with what element-- whatever element you're given and putting it in its right place.

首先是插入排序,在此算法中，需要遍历整个列表,将你遇到的第一个元素放在其正确的位置，然后移动到下一个元素，继续处理-,不管是什么元素,都将其插入到合适的位置。

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