OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.

好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。

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

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.

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

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

Well, the most famous early on, King Croesus of Lydia, the richest man in the world,you've heard all about him, decides it would be a nice thing to conquer the Persian Empire, his neighbor to the east.

最著名的就是吕底亚的克洛伊索斯国王,之前已经讲过,他是世上最富有的人,他觉得征服他东方的邻居,波斯帝国,是一个不错的事

耶鲁公开课 - 古希腊历史简介课程节选

And it's called divide and conquer for the obvious reason. I'm going to divide it up into sub-problems with the hope that those sub-problems get easier. It's going to be easier to conquer if you like, and then I'm going to merge them back. Now, in the binary search case, in some sense, this is a little bit trivial.

因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的，求解的过程也会变得简单,下面就是把结果合并起来,现在，在二分搜索的例子里,从某些方面来说，这有点微不足道。

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

Another fact is that we are told that when Alexander the Great went out to conquer the Persian Empire, and as far as he was concerned,to conquer everything he could reach, he carried with him a copy of the Iliad which it is alleged he put under his pillow.

另一个事实是,据说当亚历山大大帝,出征去征服波斯帝国时,对他而言,就是去征服他能达到的一切,他随身带着一本《伊利亚特》,据说放在他的枕头底下

耶鲁公开课 - 古希腊历史简介课程节选

I have used divide and conquer, as we seen before, to recursively break it into smaller problems. But the smaller problem of fib of 4 and the smaller problem of fib of 3 overlap with each other.

正如我们之前看到的，我已经进行了划分,并且递归性的把它分解为更小的问题,但是fib的简化问题,和fib的简化问题会相互重叠。

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