I remind you, I know you're not really listening to me, but that's OK. I reminded you at the beginning of the lecture, I said, let's assume we have a sorted list, and then let's go search it.

没关系，我告诉过你在课程的开始,我们假设这是一个排好序的列表,然后才进行的搜索,那实际上有序列表从哪里来的呢？

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

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.

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

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

Then I started to think, "Is there any way that we can save the consumers' effort and integrate everything, every function, every application, every information needs that a user wishes into one box?"

于是我开始思考，有没有一种办法，使得消费者’,省下精力与时间，将所有功能，所有应用，所有信息，按照用户所希望的，整合到一个搜索框内？

斯坦福公开课 - 百度CEO李彦宏演讲：全球最大搜索引擎的发展课程节选