When these two merges are done, we're basically at a stage in that branch where we can now merge those two together, which gives us that, and it goes through the rest of it.

拿到从那边得到的第二个子列表，这是一个基本情况,合并它，当这两个合并完成后，我们基本到了该分支阶段，这里我们可以把两个合并在一起。

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

Is it one basically? In which case, just return a copy the list. That's the simple case.

是最基本的情况吗？在这种情况下,仅仅返回一个列表的拷贝，这是简单的情况。

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

The second question I want to ask is what's the base case? When do I get down to a problem that's small enough that it's basically trivial to solve? Here it was lists of size one. I could have stopped at lists of size two right. That's an easy comparison.

第二个问题是什么是基础条件？,我要将问题分解到何时才使得问题,小到可以解决的基本问题？,这里是当列表的长度为1有时候,我也可以在长度为2的时候停止分解,那是一个非常简单的对比。

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

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.

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

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