随着为元素指定的属性个数的增加，平均查找时间也将增加。

As the number of attributes specified for an element increases, so does the average search time.

youdao

如果执行时间加上查找时间，便会获得全部的存取时间。

If you add seek time to latency, you get the total access time.

youdao

一个12 - MB的数据库的读入、装载和查找时间增加到一分钟。

For a 12-mb database, the read-load-find time jumps to well over a minute.

youdao

That is another way of saying that looking up this thing here is constant.

都是常数级的复杂度,另一种说法就是在这里查找时间是固定的。

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

Where's the penalty? What did I trade off here?

所以我可以在常数时间内做查找，太棒了？

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

I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.

我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。

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