Merge sort has o (n log n) worst-case and average-case performance.

合并排序的最差性能和平均性能为o (n log n)。

youdao

O(log n) behavior is measurably slower, but only marginally for very large task counts.

O(log n) 行为具有可测量的延迟，但是对于较大的任务数无关紧要。

youdao

Recall that returning a single character at an arbitrary position within a rope is an o (log n) operation.

返回rope内任意位置字符的操作是个o (log n)操作。

youdao

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.

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

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

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.

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

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

But mathematically, we've mentioned this before, log N or really to be precise, log base 2 of N, is the way you express this mathematically.

但从数学上说，之前我们已经提到过了，准确地说是log，N，以2为底N的对数，这就是它在数学上的表示。

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