At this point in the story, I now check while n is less than 1, what do I do?

在此时此刻，我现在在检查当n小于1是，我做什么？

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

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呢？

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

But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

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

Check first is N less than 2.

首先检查N是否小于。

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