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.

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

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