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.

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

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

Now what I'd like to do, every time I find a divisor I'd like to gather it together. So I'm going to create a tuple of one element, the value of i.

那么我就会去创建只包含一个元素的元组,也就是这个除数了,然后，啊，很好,这里是加法重载的一个很糟糕的应用。

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

We use the term element to mean the lowest value.

我们说基本值，意味着是最小值。

麻省理工公开课 - 固态化学导论课程节选

We have a pointer to the location in memory that contains the actual value, which itself might be a bunch of pointers, and we have a pointer to the actual-- sorry, a pointer the value and we have a pointer to the next element in the list. All right?

包含实际值的地址,可能实际值,也是一系列指针,这里还有指向实际，抱歉，指向下一个元素的指针,我们来整理下？

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

To get any location in memory, to get to any value of the list, I simply have to say which element do I want to get, I know that these things are stored in a particular size multiply that index by 4, add it to start, and then it's in a constant amount of time I can go to that location and get out the cell.

取得列表中的任何一个值,简单说来，想要取得列表中的任何元素,我知道这些元素存在特定的大小中,把下标乘以4，加到start上,然后定位到内存单元，并取出值就是固定的时间了,好的，如果元素以固定大小存储。

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