你可以使用给定的输入队列开始检索输入事件。

You can use the given input queue to start retrieving input events.

youdao

在本例中，它从第一行开始检索数据，然后按顺序检索，直到达到表中的最后一行。

In this case it will retrieve data starting from the first row and then sequentially until it reaches the last row in the table.

youdao

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

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?

youdao

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?

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

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

In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.

就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。

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