And if I'm walking down the list, this is probably order of the length of the list s because I'm looking at each element once.

这可能大概就是数组的长度，因为我会遍历数组中的每个元素一次,现在你可能会想，等等，数组已经排好序了。

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

Because if you did what I suggested with the list, the time to look up the key would be linear in the length of the list. You'd have to look at each element until you found the key.

字典是用一种很神奇的，叫做散列法的算法,来实现的，后面我们将,会学到一点关于。

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

I've got to count my way down, which means that the access would be linear in the length of the list to find the i'th element of the list, and that's going to increase the complexity.

的位置并去访问，然后继续下去，也就意味着,找到数组中的第i个元素的方法,是关于数组的长度呈线性复杂度的，这回增加算法的复杂度。

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