If I'm running a quadratic algorithm, it'll take one millisecond to complete.

算法会在1毫秒内完成，如果问题的复。

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

If I'm running a linear algorithm, it'll take one microsecond to complete.

算法会在1微秒内完成，如果是一个平方级的方法。

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

And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.

在这个例子中，我们从8得到4，到2，再到1，是3次,在这个算法的每次迭代中，每一趟我都会操作N个数，也就是所我每次要做N步操作，一共要做，log，N，次。

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

The OWGR is seldom criticized for determining the 100 top-ranked players who are usually invited to play in the PGA Championship, or the 50 who automatically receive Masters invitations, But when the algorithm spits out the name of a No. 1 player who has not won a major recently, or at all, that's another story.

WSJ: McIlroy,Donald and Westwood: How Golf Crowns Its World No. 1 | Golf Journal by John Paul Newport