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.

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

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

to the n, every value in the 1 bit vector we looked at last time is either 0 or 1. So it's a binary n number of n bits, 2 to the n.

从2到n，我们上次看到的,位向量的每个值不是0就是,所以它是n，比特的二进制数,从2到。

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