The group says this was the first time it gave a documentary crew unrestricted access to its field operations.

VOA: special.2010.07.26

Wow, OK, maybe not so wow, but this is now constant. This is constant time access. So I can do searching in constant time which is great.

喔，当然，可能没那么,但是现在是常数级了,这是常数时间的访问。

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

Remember we said we design lists so that the access, no matter where it was on the list was of constant time.

记住我们说过我们创建了,一个列表它就是这么访问的,无论它在列表的哪个位置。

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

This is from a U.S. Government website called treasurydirect.gov and you can get on and access it at any time.

来自于美国政府网站,treasurydirect.gov,你们也可以随时访问

耶鲁公开课 - 金融市场课程节选

- Well -- and I'll fix this blue next time -- I'm first telling the compiler I need access to the standard io library because printf is declared there.

哦！--下次我把这个字体颜色改成蓝色的-,我先告诉编译器--我需要使用,标准输入输出库,因为printf在那个库里面申明的。

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

I have constant time access which is great, but I paid a price, which is I had to use up some space.

我的访问时间现在是常数级别，这个非常的棒，但是我也付出了代价，不得不使用更多的空间，在整数的例子中。

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

And in that case, in general lists, I need to figure out what's the access time.

一些浮点数，一些字符串，一些数组内部的数组，各种各样。

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

And as a consequence, access time in the list is constant, which is what I want.

这会占用一些额外的空间，回到问题本身，这么做的话，读取数组的时间就变成常量了。

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

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.

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

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

You might say, why? Well it turns out there's some trade-offs to it. It has some advantages in terms of power of storing things, it has some disadvantages, primarily in terms of access time.

那可能是某种意义上的权衡,对存储而言，这有优势,但访问的效率上就变成劣势了,幸运的是，python或者。

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