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

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

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

All right, having said that, let's do some examples. I'm going to show you a sequence of algorithms, they're mostly simple algorithms, that's OK.

好，让我们开始看例子吧,我将会给大家讲,一系列的算法，这些都是挺简单的算法。

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

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.

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

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