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.

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

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

When we're doing something that is interactive, we have to cut down on the detail of what we're doing because we can't support that in real time, but nonetheless there're lots of things we can do interactively.

当我们在做一些,互动性的项目时，我们需要减少,正在做的细节,因为在实际时间里,我们并没有足够时间支持它，但是还有很多其他东西,可以做得具有互动性。

麻省理工公开课 - 媒体、教育、市场课程节选