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.

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

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

And that's like kind of hoping that the element you're searching for is the first in the list and the last in the list. Maybe.

也就是希望要找的元素,在数组的头部或者尾部,情况可能是这样的。

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

But I can also ask for parts of this. So I can, for example, say give me the first element of s1 string 1, s 1. Ah, that's exactly what we would have thought if this was represented as an ordered sequence of things.

然后返回一个长字符串，我也可以，取字符串的一部分，例如,我可以要求返回给我字符串,的第一个元素，啊，这证明我们之前,认为的它是一个有序的字符序列的想法。

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