Linear algorithms tend to be things where, at one pass-through, you reduce the problem by a constant amount by one. If you reduce it by two, 1 it's going to be the same thing.

有问题么？,线性复杂度的算法，当进行了一个,常量级步数的操作的时候，将问题的规模缩小了一个。

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

Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.

我们学习过了线性算法，它的典型特征，不是通用的,但是比较典型的特征是，它是逐一减小问题的大小的，或者说是每次减小常数的大小。

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

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

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

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

How many moles of gas are there in each case, in reactants and products? If that changes, of course you know that the pressure in there is going to change at constant volume if the amount of gas in there is changing.

在反应物和生成物中，各有多少摩尔的气体？,如果它发生了变化,当然在等体条件下，如果气体的总量,发生了变化，压强也会发生变化。

麻省理工公开课 - 热力学与动力学课程节选

To get any location in memory, to get to any value of the list, I simply have to say which element do I want to get, I know that these things are stored in a particular size multiply that index by 4, add it to start, and then it's in a constant amount of time I can go to that location and get out the cell.

取得列表中的任何一个值,简单说来，想要取得列表中的任何元素,我知道这些元素存在特定的大小中,把下标乘以4，加到start上,然后定位到内存单元，并取出值就是固定的时间了,好的，如果元素以固定大小存储。

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

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

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

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

Just take it as a constant amount of operations But.

那让我们看看下一步呢？

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

Obviously-- and that's a bad way of saying it, I said constant the previous time-- in the linear case, it's subtract by certain amount.

这么描述很不准确，我之前在，线性算法中也说了常数,它是每次减少固定的量。

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

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.

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

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