Well, it looks like it took 1 in this case or it involves-- we can put it another way, merging those two lists involved looking at two numbers, 1, 2, and that's it.

在这种情况下看起来只用了1次-,我们可以从另一个角度看，合并这两个列表涉及到了,2个数字，1，2，就是这样。

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

Well, notice again, on each level of the tree, when I actually do the merging, so this remember, is when I wrote down just the numbers when I bottomed out with the list of size 1.

请注意，在这棵树中的每一层，我真正做合并时，就将每个大小为1的列表中的,数字写下来。

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

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个数字，我创建了一个这么长的列表，并且我只是简单的标志这些东西。

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

Just point at the start of this list, and this one so which number comes first?

指向列表的开始处，对于它来说,哪个数字在前面？

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