It is easier to fall off the log than to stay on it.

VOA: special.2009.06.07

And as a consequence, it is log.

因此这是对数级复杂度的算法。

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

We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.

我告诉了你们这是一个对，数级的算法，这是很棒的,我们来一起看看这个算法到底做了什么。

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

It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.

但这至少证实了归并排序,的时间复杂度为。

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

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.

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

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

Boy, there's a dumb question, because I've been telling you n log n for the last two lectures the complexity is n log n, but let's see if it really is.

孩子们，这是一个愚蠢的问题，因为前两节课的时候我就已经告诉你们了,复杂度是,但是让我们来看一下是不是真的是这样。

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

Yeah. Log. It's a good think, but why do you think it's log? Ah-ha. It's not a bad instinct, the length is getting shorter each time, but what's one of the characteristics of a log algorithm? It drops in half each time.

对了，对数，这是个好想法,但是你们为什么认为是对数呢？,啊哈，这样的本能不错，每次长度都会缩小些,但是对数算法的特性是什么。

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

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纳秒的时间，你一眨眼的时间。

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

It would be nice if it was less than linear, but linear is nice because then I'm going to get that n log in kind of behavior.

那么就是一个不错的算法，但是线性方案也是很好的,因为我需要做n次的log级的行为。

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