So in fact, over the next thirty or forty minutes we're going to show you a set of examples of sort of canonical algorithms, and the different classes of complexity.

在接下来的三四十分钟里面,我们将要讲一系列的,权威算法，以及不同种类的复杂度问题。

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

What have we done over the last three or four lectures? We've started introducing you to classes of algorithms. Things that I'd like you to be able to see are how to do some simple complexity analysis.

我们在过去三节或四节课中讲了什么？,我开始向你们,介绍算法的类型,我想你们知道的是,如何做一些简单的复杂度分析。

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

We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.

我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。

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

We don't like exponential algorithms, or at least you shouldn't like them, because they blow up quickly. And we saw some examples of that. And unfortunately, some problems are inherently exponential, you're sort of stuck with that, and then you just have to try be as clever as you can.

我们并不喜欢指数算法，至少你不应该喜欢，因为他们会,爆炸式的增长，我们将看到,这样的例子，不幸的是，一些问题先天是指数型的，你会被它们稍稍的卡住,然后你就得尽可能的发挥你聪明才智了。

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