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.

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

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

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.

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

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

If you're taking two derivatives you can add a constant and something linear in t.

如果你要二次求导,你可以添加一个一次项和常数项

耶鲁公开课 - 基础物理课程节选

That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.

所以让我们来思考一会,要在线性时间能排序，列表里每个元素最多被使用常数次,不一定是一次，对吧。

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

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.

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

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

Quadratic, linear, log, constant? Any takers?

线性，log，常数？有没有人回答？

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