And that's because that is a version of a divide and conquer algorithm.

这个想法非常重要,因为这就是分而治之算法的一个版本。

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

A really nice algorithm. As I said, an example of divide and conquer.

真的很好的一个算法，就如我说的。

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

Notice here that it's different than the binary search case. We're certainly dividing down, but the combination now actually takes some work. I'll have to actually figure out how to put them back together. And that's a general thing you want to keep in mind when you're thinking about designing a divide and conquer kind of algorithm.

一个分治的例子,注这里，与二分查找所不同的地方,我们肯定是分解了,但是合并的过程还是需要一些工作量的,我会详细说明怎样把它们合并在一起的,当你在考虑设计一个分治算法时,这是你要必须记住的最基本的东西。

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