Log? Linear? Exponential? Quadratic?

对数？线性？指数？平方？

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

Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.

这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。

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

Let's suppose n is 1000, and we're running at nanosecond speed.

假入我们一秒钟运算十亿次，我们已经看过了对数级，线性增长的。

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

We've seen log, we've seen linear, we've seen quadratic, we've seen exponential.

我们看过了对数级的，线性的，二次平方的，指数级的算法。

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