A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.

对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。

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

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.

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

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

This chart, very boring and uninteresting but useful to say there are very well defined rules as to when you're writing code, what operators, like what syntax should get evaluated first.

这个图表，看起来很烦，很无趣，但是它很有用,有非常明确的规定,譬如，当你写代码时，就会涉及操作符的优先级。

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