The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.

对于大多数操作，红黑树的执行时间为 O(log n)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。

youdao

Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.

和其它的提供了最坏情况O（log n） 查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。

youdao

This will allow a log (n) look up of packets referenced by SACK options.

这允许对SACK选项指向的包进行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的对数，这就是它在数学上的表示。

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