As I said, what we want to do is, we want to count the number of basic steps it takes to compute a computation as a function of input size.

我刚才提到了，我们要建立，一个根据输入大小的方法来计算,一个计算过程需要的时间,建立这个方法需要几步呢？

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

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步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

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