Experts continue to debate how best to close this digital divide.

VOA: special.2010.04.12

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.

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

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

So if I try to apply the same logic, well how can I divide and conquer this problem.

如果我想要用同样的逻辑，那么怎样划分,并解决这个问题呢？

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

The first step is divide them in half. All right? I'm not sure how to mark it here, remember I need to come back there. I'm not yet done. What do I do?

我不能确定如何,在这里进行标记,记住我会回这里进行讲解,我还没做完呢？

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

So if I start off with a list of length n, how many times can I divide it by 2, until I get to something no more than two left?

我能够除以多少次2呢？,直到我得到的长度不超过2么？,对数次，对吧？就像刚才那位同学说的那样？

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

How many times you can divide N by 2 before you get down to 1?

在得到1之前需要将N除以2做几次呢？

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