All right? It's now something that I can search in constant time. And that's what's going to allow me to keep this thing as being log.

在固定的时间内搜索,这样就可以让时间复杂度保持在对数级,好的，考虑过了这些。

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

If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.

如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。

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