Therefore, for simple branching programs, the length of time, the complexity the code, is what we would call constant.

因此，对于简单的分支程序，运行的时间长度，算法的复杂度，也就是我们说的常数。

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

The message I'm trying to get to here, because I'm running you right up against time, is I have to be careful about what's a primitive step.

我想说的事情是，因为我正在跟大家讲算法时间复杂度，我们需要注意一个基本步骤的定义,如果我可以假设。

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

I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.

我需要得到此算法的时间复杂度,那就明确地给出其,运行时间。

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

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

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