-
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.
列表中间的一个部分了，然后我求出列表的中值点,然后看看该点的值是不是等于目标值，如果是的话就完成了，如果不是的话，如果中位值大于我要找的目标值。
-
And that you might look at, for example, that first example, and say, man by this stage it was already sorted, yet it had to go through and check that the third element was in the right place, and then the fourth and then the fifth and then the six.
你可能会去看看例如第一个例子，然后要抱怨，到这里,它已经是排好序的了,但他还是得去遍历查看,第三个元素是不是在正确的位置,然后第四个，第五个，第六个。
-
You can work through this game and you can check pretty quickly that nothing is dominated.
当你从头到尾 仔细分析过之后,你会发现这里没有劣势策略
-
And so if incidentally, you're a representative of a student group and the alike and your Google calendar is not -- in here, you can check just by flipping through the various-- we have over 200 calendars right now and you can search through them here.
如果你是一个学生团体的代表,你的Google日历在此不存在,你可以检查其他各种各样的-,目前我们有200多种日历,你可以在它们之中进行查找。
-
You try to design actually I'm going to come back to that in a second. It's like you're trying to use a hash function that spread things out pretty evenly. But the places you store into in those lists may have to themselves have a small list in there, and when you go to check something, you may have to do a linear search through the elements in that list.
你尝试着去设计,实际上过会儿我会回头讲解这个问题,类似于你需要用一个哈希函数,非常平均的将物体分发出去,但是在列表中你数据,映射到的地方可能会有自己的一小段列表，当你回头查找数据的时候,你可能需要在那一小段列表中做线性查找。
-
In fact, we could check that if the attacker attacks through the easy pass, not surprisingly, you do better if you defend the easy pass than the hard pass: 1 versus 0.
我们来分析一下,如果入侵者选择平坦之途,毫无疑问,如果你选平坦之途要比崎岖之途更好,1比0
-
Well, now I go through code very much like what I did for max val in the first place. I check whether it's 0, et cetera, et cetera.
现在我会捋一遍代码,就像我之前捋maxval函数一样,我会检查它是不是0等等等等。
-
I'm going to give a name to that. And what you see there is I'm going to call divisors initially an empty tuple, something has nothing in it. Right here. And then I'm going to run through the same loop as before, going through this set of things, doing the check.
你们可以看到这里,我初始化一个空的元组,名为divisiors，这里，然后我会去运行,跟以前一样的循环，遍历这个集合内的东西,然后做检查，现在我要做的是，每次我找到了一个除数我要把它收集起来。
-
All right, we're-- well actually, I should say that better, we first check to see, is x 0 greater than or equal to zero, if it's not, then we come down here and we print something out, otherwise we run through a little loop to get the answer, and then we check it and we spit something out.
然后我们运行一个小循环,好了，我们现在来看看,如果x≥0或者x＜,我们看这儿,我们会输出一些内容,或者我们运行一个小循环来获取答案,然后我们检验一下，然后得到结果。
应用推荐