I'm gonna tell you go sort the left, go sort the right, and then I'll merge the two together.

那先对左半部分排序，再对右半部分排序，然后将两者合并起来。

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

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.

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

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

You have to touch each of the 16 elements once as I go across the blackboard to actually merge them together, alright.

为了将这16个元素,合并到一起,对每个元素都只会用到一次。

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

Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.

在这些上面再运行归并排序，根据归纳，如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。

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

How much work do I have to do to actually merge them together?

我需要耗费多大的工作量来他们进行合并？,让我来举个例子？

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

It is going to merge them together into one thing.

这样会把两个字符串合并到一个东西里面去。

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

So to just preface what we're going to do next time, what would happen if I wanted to do sort, and rather than in sorting the entire list at once, I broke it into pieces, and sorted the pieces, and then just figured out a very efficient way to bring those two pieces and merge them back together again?

所以为了引导下一次,我们要讲的内容,如果我想做排序,而且不是一次吧整个列表排完,会发生什么，我把它拆成小的列表,然后把各个小列表排序,接着用高效的方法再把小的列表？

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