Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.

这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。

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

When he goes to Europe on his big sortie, on his big-boy trek through Europe he goes around and he visits all of these botanical gardens.

他的访问团曾到欧洲,在穿越欧洲的成年之旅中,他到处游历,参观了各种植物园

耶鲁公开课 - 欧洲文明课程节选

Why? Because that's a constant access, right?

常数时间的访问，对么？要在内存中定位？

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