Having done that, it goes back up and picks the second sub-list, which came from there. It's a down to base case, merges it.

就是从那里得来的,完成这些后,回到上一步。

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

I just kept sub-dividing down until I got really easy problems, and then I combine them back.

我不断的进行子分解,直到得到简单的问题，然后我再把它们合并回去。

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

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.

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

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