Constant. Ooh, constant says, no matter what the length of the list is, I'm going to take the same amount of time.

这个算法用的时间是相同的，我不这么认为，如果我们创建一个十倍于以前大小的数组。

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

Okay, so 1 is a viable answer in some contacts that needs constant time, the same amount of time no matter what.

在需要常量时间的情况下,答案是1，不管怎样，总时间是,相同的。

哈佛公开课 - 计算机科学课程节选

So, would it take, for example, the same amount of time as the frequency?

它需要，比如说,和频率一样的时间吗？

麻省理工公开课 - 化学原理课程节选

But that's also nice, it lets you see how the recursive thing is simply unwrapping but the complexity in terms of the amount of time it takes is going to be the same.

它让我们看到了，在复杂度依照时间总数来看,没有变化的情况下,递归是怎么一步步的展开的,我欠你一个糖，谢谢。

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

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.

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

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

So we're to assume we can get to any piece of data, any instruction in constant time, and the second assumption we're going to make is that the basic primitive steps take constant time, same amount of time to compute. Again, not completely true, but it's a good model, so arithmetic operations, comparisons, things of that sort, we're all going to assume are basically in that in that particular model.

因此如果我们假设在恒定的时间内,我们可以取得任何一块数据,任何一种数据结构的话,我们要做的第二个假设就是,基本的原始操作计算花费的时间是恒定的,这个假设也不是完全正确的，但这个模型其实挺不错的，因此算法操作，比较，这一类的事情，我们在这个特定的模型中都假设是基本的,操作，花费的时间是恒定相同的。

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