If it was an unordered list, we were basically stuck with linear search. Got to walk through the whole list to see if the thing is there.

如果是一个未排序的列表,基本上我们就只能使用线性搜索了,通过遍历整个列表来查看。

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

So, as the gentleman back there said, if I'm searching it once, just use the linear search.

如果我就搜索一次，就用线性搜索吧，另一方面。

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

If I look for, say, minus 1, you might go, gee, wait a minute, if I was just doing linear search, I would've known right away that minus one wasn't in this list, because it's sorted and it's smaller than the first elements.

如果我要查找-1，你可能要怒了，呵呵，等一等，如果我用的是线性查找，我不会知道-1不在这个列表中,但是列表是排好序的,1又比第一个元素小。

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

Well let's see. My fall back is, I could just do linear search, walk down the list one at a time, just comparing those things. OK. So that's sort of my base. But what if I wanted, you know, how do I want to get to that sorted list? All right?

我只能做线性搜索了,一次遍历一遍列表，一个一个比较，但如果我想要,那怎样得到有序的列表呢？,现在的一个问题是，我们排序之前？

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

Think about this compared to a linear search.

线性查找总是从开头开始遍历。

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