Having done that, it goes back up and picks the second sub-list, which came from there. It's a down to base case, merges it.

就是从那里得来的,完成这些后,回到上一步。

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

So in this case, one of the standard ways to do this, is to use what's called a linked list.

标准的处理方法是使用链表,我接下来也准备这么做。

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

Still quadratic, right? I'm looking for the worst case behavior, it's still quadratic, it's quadratic in the length of the list, so I'm sort of stuck with that.

还是平方，对吧,我在寻找最坏的情况，它还是平方，它是列表长度的平方，我对此有点无奈了。

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

So the first thing we'll do is, we'll print the element, in this case it will be a list right? Because it's a list with two lists in it.

因此这儿我们要做的第一件事，就是要显示元素，在这儿元素就是数组了对不对？,因为这个数组包含了两个数组。

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

If it's there, I'm done, if not, I keep walking down, and I only stop when I get to a place where the element I'm looking for is smaller than the value in the list., in which case I know the rest of this is too big and I can stop.

并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大，但是其他的情况,我还是要遍历完整个数组。

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

Is it one basically? In which case, just return a copy the list. That's the simple case.

是最基本的情况吗？在这种情况下,仅仅返回一个列表的拷贝，这是简单的情况。

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

In the case of characters, so I have to give up a list of 256, no big deal.

我需要给出一个有256个空间的列表，不是很大的开销。

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

The worst case here is, the things not in the list in which case I've got to go all the way through the list to get to the end.

目标数不在数组里,这意味着我必须遍历数组中所有的元素,好，说完了这些。

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

Here's the problem. How do I get to the nth- er, the k'th element in the list, in this case?

如何找到第n个元素呢-,在这里，如何找到第k个元素呢？

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

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

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

So, for example: in this case, my list is a bunch of integers. And one of the things I could take advantage of, is I'm only going to need a finite amount of space to represent an integer.

列表是一系列整数,要注意的这里的优势能够,用有限的空间来表示整数,例如，如果我想要操作。

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

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的时间去对其进行排序。

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