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

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

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

We talked about the inevitability of death; we talked about the variability, that people have different lengths of time before they die.

我们讨论过了死亡的不可避免性;,我们讨论过了其可变性，不同的人在他们死之前有所的时间长度不同。

耶鲁公开课 - 死亡课程节选

And we said that was log rhythmic, took log n time where n is the size of the list.

当列表的长度为n的时候，整个算法耗时log，n的时间。

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

By regular rate we mean that the amount of time that each chord holds is exactly the same; every chord holds for the same length of time.

如果变化频率规则，那么和声中每个和弦持续的时间长度是完全相同的;,每个和弦都持续同样长的时间。

耶鲁公开课 - 聆听音乐课程节选

It's not true, by the way, of all programming languages. In fact, Professor Guttag already talked about that, in some languages lists take a time linear with the length to get to it.

顺便说一句这在大部分，编程语言中做不到，实际上Guttag教授已经说过这一点了，在一些语言中取得数组,要花费时间是线性长度的。

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