"The right environment means, first of all, looking at the list with the United Nations and removing names that are not part of al Qaida, that are not part of a terrorist network, that are just there because somebody decided to put them in,"

VOA: standard.2009.03.28

First, it's pointing to the beginning of the list, which initially might be down here at but after a while, might be part way through. And to that, I simply add a halfway point, and then I check.

列表中间的一个部分了，然后我求出列表的中值点,然后看看该点的值是不是等于目标值，如果是的话就完成了，如果不是的话，如果中位值大于我要找的目标值。

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

Now you might say, wait a minute. Thing's ordered, if I stop part way through and I throw away half the list, doesn't that help me? And the answer is yes, but it doesn't change the complexity.

如果我在半路上停下来,然后不去遍历剩下的数组了,这会有帮助么？答案是有帮助，但这没法改变算法的复杂度，因为我们之前怎么说来着？

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

So, whether or not the email is addressed specifically to you in like the two field or if maybe you were BCC'd or it's a big email list of which you're just part, that could signify that this is in fact useful for you.

所以，不管这个邮件是不是,单独发给你的,或者这个邮件有一个大的邮件列表,而你正在其中，其实这也暗示了,这个邮件对你是有用的。

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

And all these other things are not part of the list."

其他东西都不在书目里面“

耶鲁公开课 - 新约课程节选

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,并没有放到阅读列表里,而是在“资源“里，所以你可以阅读吉卜林的作品。

耶鲁公开课 - 金融市场课程节选

I'm going to set up an index, which is going to tell me where to look, starting at the first part of the list, right?

索引告诉我从哪里开始检索数组，对不对？,然后我会去记录下我做了多少次比较，这样我就能看到这个算法的工作量了？

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

As I keep moving down, that part gets smaller, it's not always the initial length of the list, and you're right. But if you do the sums, or if you want to think of it this way, if you think about this more generally, it's always on average at least the length of the list.

等等，随着移动，剩下的部分越来越小，并不是初始那么长了，如果你算一算，或者你这么想，你考虑更一般的情况，平均下来至少是列表的长度。

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

We're going to call binary search, it's going to take the list to search and the element, but it's also going to say, here's the first part of the list, and there's the last part of the list, Well, it checks to see, is it bigger than two?

我们将要调用这个二分查找,它将会在列表里面搜索元素，假定这里是，列表的第一个元素,那里是列表的最后一个元素，代码内部到底做了什么？

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

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.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

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