And the third thing I need to decide is how do I combine? You know, point out to you in the binary search case, combination was trivial. The answer to the final search was just the answer all the way up.

第三个问题是我需要决定如何进行合并？,就你们所知的，在二分查找中所打印出来的,合并的过程是非常简单的,最后查询的结果,就是一路上来所以的结果。

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

So things that are good candidates for divide And conquer are problems where it's easy to figure out how to divide down, and the combination is of little complexity.

因为适合用分治算法解决的问题,最好是能够简单的将问题进行分解,并且合并的过程不是非常的复杂,只要比线性方案要小。

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

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

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

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

If I'm basically just squeezing jello, that is, I'm trying to make the problem simpler, but the combination turns out to be really complex, I've not gained anything.

如果我只是简单的挤压果汁，那么我是在尝试着让问题变得简单，但是合并过程就真的比较复杂,我得不到任何东西。

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