-
So if I call, let's , let's set up s to be, I don't know, some big long list.
那让我们来调用一次吧，让我们建立一个，怎么说。
-
so she made up her art gallery where there were a bunch of like these old B-list movie posters.
所以她开了自己的美术馆，那里有很多古老的B级电影的海报。
-
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.
就是从那里得来的,完成这些后,回到上一步。
-
We find ourselves easily intimidated by a list of famous names and end up not thinking for ourselves.
我们才惊觉自己很容易受到盛名的威吓,结果忘记为我们自己多想想。
-
So, these are an important list of factors as to the factors that can make somebody less likely to bring it up to the killing level.
这些都是很重要的影响因素,它们能使电击者,进行致命电击的可能性降低。
-
We add up the goods, subtract the bads-- whatever our favorite list is-- and we come to our best educated guess about the rival evaluations of not just lives as a whole, but chunks of lives.
我们把好事加起来减去坏事-,不管我们最喜欢哪些事-,我们不但可以据理推测,一生期间其他生活的价值，还能推测某段时间其他生活的价值。
-
I'll just take up the list toward the end: "transcendentality, consciousness, or conscience, God, man, and so forth."
我来把这张表说完：,“先验性，意识，上帝，人类，等“
-
I put it up on the ClassesV2 not as part of the reading list but it's under Resources so you can read Kipling.
我把它放到V2类别2,并没有放到阅读列表里,而是在“资源“里，所以你可以阅读吉卜林的作品。
-
In the case of characters, so I have to give up a list of 256, no big deal.
我需要给出一个有256个空间的列表，不是很大的开销。
-
Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..
好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
-
I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.
你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。
-
So I'm going to go over here, and I'm going to type test search-- I can type and if you look at your handout, it's just a sequence of tests that I'm going to do OK. So initially, I'm going to set up the list to be the first million integers.
大家可以看看你们的课堂材料，那儿有一些我要做的实验,好，一开始我先去建立个，含有一百万个integer的数组,对，这有点儿简单,但是这给我提供了这样一个有序的数组。
-
And built up the list corresponding to the three items that the user entered.
建立起对应的数组来，因此这里,我能得到的唯一中间值就是res了。
-
We can put a list in the list again, as we've seen before. So let's put the list containing the string a, and I'll print out so now we see something pretty interesting about a list, that we can mix up all sorts of things in it, and that's OK.
数组放到数组中去，让我们把这个包含,字符串a的数组放进去,然后再显示，我们看到了一些,挺有趣的事情：我们可以把各种,各类的东西混合着放进去，没问题。
-
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.
字典是用一种很神奇的，叫做散列法的算法,来实现的，后面我们将,会学到一点关于。
-
So now here's the idea. I build a list 256 elements long, and I fill it up with those special characters none.
所以这里就是这种思想6,我创建了一个可以放下256个元素的列表,然后我以这些没有实际意义的字符将其填充。
-
I shouldn't say list, those two tuples, and walk through them to find the pieces that match up.
除数数组进行对比，我不该说数组的，是元组,遍历这两个元组找到相同的元素。
-
OK. And I'm going to look to see, is a particular element inside of that list, and again, I'll remind you, that's just giving me the integers from zero up to 9999 something or other.
一个又大又长的列表吧，好的,我打算查找列表中的一个特定元素，我会告诉你，我用的是0到大概是,9999左右的整数。
应用推荐