Cut the problem in half. Cut the problem in half again. And that's a typical characterization of a log algorithm.

是每次除以特定的量,将问题减一半，再减一半,如此，这就是对数算法的典型特性。

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

and we like log algorithms, because they're really fast. A typical characteristic of a log algorithm is a pro-- or sorry, an algorithm where it reduces the size of the problem by a constant factor.

并且我们也很喜欢对数算法,因为它很快,对数算法的典型特性是高速，哦，抱歉，是他能以常数因子的速度,降低问题的大小，很明显。

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

Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.

我们学习过了线性算法，它的典型特征，不是通用的,但是比较典型的特征是，它是逐一减小问题的大小的，或者说是每次减小常数的大小。

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

And we saw a couple of examples of linear algorithms.

这是线性算法的典型例子,我们在过去也看过了大量的线性算法的例子。

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