-
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.
并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大，但是其他的情况,我还是要遍历完整个数组。
-
I shouldn't say list, those two tuples, and walk through them to find the pieces that match up.
除数数组进行对比，我不该说数组的，是元组,遍历这两个元组找到相同的元素。
-
The better way to think about this is, suppose, rather than starting at the beginning, I just grabbed some spot at random, like this one.
不从数组的头开始遍历，我随即的从数组中抓一个元素，比如这个，我去看看这个元素的值。
-
What's the size of the list?
如果我遍历一个数组的话？
-
I'm walking down the list.
算法遍历了一遍数组。
应用推荐