So I have n operations log n times, n log n there we go, n log n. Took us a long time to get there, but it's a nice algorithm to have.

所以我log，n遍的n次操作，就得到了,虽然花了不少时间得到了这个结论。

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

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级的行为。

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