Failing to fetch me at first keep encouraged, Missing me one place search another, I stop somewhere waiting for you.

VOA: special.2009.04.12

Done. All right? The basic, that primary search, because it looks at the first element, says it's smaller than everything else, I'm done.

以及其他的元素，检索完成，让我试试二分法呢？,可能会用更长的时间，请注意这里的输出。

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

OK. So if I look at this code, first of all I'm calling search, it just has one call, so looks like search is constant, except I don't know what happens inside of b search. So I've got to look at b search.

首先调用一下搜索，就一步调用,看起来搜索是固定的，除非我不知道二分搜索的原理，那我们来看看二分搜索吧,所以让我们看看，第一行打印出来的内容。

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

One of the first people involved in that search was James Lind of Scotland.

VOA: special.2009.04.21

We're going to call binary search, it's going to take the list to search and the element, but it's also going to say, here's the first part of the list, and there's the last part of the list, Well, it checks to see, is it bigger than two?

我们将要调用这个二分查找,它将会在列表里面搜索元素，假定这里是，列表的第一个元素,那里是列表的最后一个元素，代码内部到底做了什么？

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

On the other hand, if I want to sort it first, OK, if I want to do sort and search, I want to sort it, it's going to take n log n time to sort it, and having done that, then I can search it in log n time.

我先排序，好的，如果我想排序再搜索，我要排序，这需要花n，log，n时间排序，然后做完了，我们能花log，n时间搜索,啊，哪一种更好呢？恩，呵呵。

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