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.

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

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

So supposed that I give you 16 elements to sort, well, following the logic before, the running time involved in sorting 16 elements is gonna be twice the running time 16 of sorting 8 elements, left half and right half plus 16 - and again, a little sanity check, 16 means-- just the merge steps, right?

现在要对16个元素进行排序，根据之前的逻辑，对16个元素排序,要花的时间是对8个元素排序所花时间的,2倍，分别用于左半部分和右半部分，再加上6,这里16是-,做合并的步数，对吗？

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