So if I call, let's , let's set up s to be, I don't know, some big long list.

那让我们来调用一次吧，让我们建立一个，怎么说。

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

And in the next spot, maybe I've got a really long list, and I'm going to say how to jump to get to the next element.

可能我得存放一个很长的列表了,你们也明白如何定位下一个元素,好的，这很棒，这样我有一个。

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

Lisp The problem with that technique, while it's very general, is how long does it take me to find the i'th element of the list?

很多编程语言包括，都是用了这种技术,这个问题就是，当数组很大的时候？

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

Hmm. Well, wait a minute. If I want to sort a list, I'll take one element, I've got to look at probably a lot of the other elements in the list in order to decide where it goes. And that suggests it's going to depend on how long the list is.

我会取一个元素，然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对，这没什么说服力，但是事实上。

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

I'm accessing a list. How long does it take for me to get the nth element of a list?

我取得数组的第N个元素,需要多长时间呢？

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

So, what's the idea? If I know what my hash function does, it maps, in this case characters into a range zero to 256, which is zero to 255, I create a list that long, and I simply mark things.

我知道我的哈希函数做什么,在这个例子中，它将字母，映射成0到255的256个数字，我创建了一个这么长的列表，并且我只是简单的标志这些东西。

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