Here's another way to think about why is this log.

那我来问一个完全不一样的问题。

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

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的对数，这就是它在数学上的表示。

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

And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.

这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。

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