The easy thing to do would be the following: start at the front end of the list, check the first element. If it's the thing I'm looking for, I'm done. It's there. If not, move on to the next element. And keep doing that.

从数组的第一个元素开始：,如果这是目标元素那么结束,如果不是的话就继续比较下面的元素，并一直这么比较下去,但如果，在某一点我发现我要寻找的数字。

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

When you decide to become a front-end consumer-oriented service, you really need to be better than your competition.

当作为前端客户导向型的服务提供商时，就需要做得比竞争者更好。

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

At the end of the first round, I've got the smallest element at the front. At the end of the second round, I've got the smallest two elements at the front, in fact I got all of them sorted out. And it actually runs through the loop multiple times, making sure that it's in the right form.

看看发生了什么，在第一轮结束后,我把最小的元素移到了前面,第二轮结束后，我把最小的,两个元素移到了前面，实际上,所有的元素都排好序了,实际上，这个算法运行了几次循环，确认下这是正确的形式。

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

So in the summer of 2001, we decided to switch gear from a backend technology provider to a front-end consumer-oriented search service.

于是在2001年夏，公司决定从后台技术提供者,转变为直接面向消费者的搜索服务提供方。

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

And when I do this test, what I want to do, is say I'm going to pick the middle spot, and depending on the test, if I know it's in the upper half, I'm going to set my start at the mid point and the end stays the same, if it's in the front half I'm going to keep the front the same and I'm going to change the endpoint.

如果我知道目标数可能，再比中值点大的区间里，我可能就会把开始点设为中值点,而尾点不变，如果在小的那个区间里,就保持开始点不变而把尾点设为中值点，你们可以看到这儿的代码,就是这么做的,对不对？它是怎么做的？

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