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.

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

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

I want you to recognize classes of algorithms and match what you see in the performance of the algorithm to the complexity of that algorithm. All right?

让我再试一次这么说,我期望大家能通过,算法的复杂度,来看到算法的性能？

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

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.

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

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

But I want you to take away from this how we reason about the complexity of these algorithms. And I'll remind you, we said we're going to mostly talk about time.

但是我想你们理解我们,是怎么推出这些问题的复杂度的,提醒大家，我说过了我们主要讨论时间问题。

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