N log N is not nearly as good as log N. As a sanity check, what algorithm have we seen that runs in log N time?
而N,log,N和log,N并不一样,我们之前探讨过的哪个算法其时间复杂度是log,N呢?
哈佛公开课 - 计算机科学课程节选
应用推荐
模块上移
模块下移
不移动