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

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

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

Remember we said we design lists so that the access, no matter where it was on the list was of constant time.

记住我们说过我们创建了,一个列表它就是这么访问的,无论它在列表的哪个位置。

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

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.

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

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

It goes through and puts ones in the right place.

它遍历整个列表并提到正确的位置。

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