I've written a little for loop, which is going to iterate over all of the elements in the list.

让我们先看看这儿的代码，我已经写了一个循环语句,用来迭代处理数组中所有的元素。

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

It took me seven comparisons, because I can take advantage of the fact I know I only ever have to look at the first element of each sub-list. Those are the only things I need to compare, and when I run out of one list, I just add the rest of the list in.

进行了7次对比，因为我可以利用我知道的优势：,每次只需要比较每个子列表的第一个元素,那才是我需要进行对比的内容,当一个列表的元素处理完了,只需要将另一个列表剩下的元素直接添加进去。

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

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.

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

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

I just doubled the indentation each time so you can see it. So each successive call, notice what's happening. The argument is getting reduced. And we're going another level in. When we get down to this point, we're calling it with just a string of length one.

因此每次成功调用注意它的过程,我们的命题不断简化，而且我们不断深入嵌套,当我们走到这一步的时候,我们就是在调用它处理，仅有一个元素的字符串了。

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