A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.

对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。

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

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.

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

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

And we said that was log rhythmic, took log n time where n is the size of the list.

当列表的长度为n的时候，整个算法耗时log，n的时间。

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

If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.

如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。

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