Now you might say, wait a minute. Thing's ordered, if I stop part way through and I throw away half the list, doesn't that help me? And the answer is yes, but it doesn't change the complexity.

如果我在半路上停下来,然后不去遍历剩下的数组了,这会有帮助么？答案是有帮助，但这没法改变算法的复杂度，因为我们之前怎么说来着？

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

If it's there, I'm done, if not, I keep walking down, and I only stop when I get to a place where the element I'm looking for is smaller than the value in the list., in which case I know the rest of this is too big and I can stop.

并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大，但是其他的情况,我还是要遍历完整个数组。

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