I remind you, I know you're not really listening to me, but that's OK. I reminded you at the beginning of the lecture, I said, let's assume we have a sorted list, and then let's go search it.

没关系，我告诉过你在课程的开始,我们假设这是一个排好序的列表,然后才进行的搜索,那实际上有序列表从哪里来的呢？

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

I just wish we could do it together, but that's ok.

我就是希望我们俩能一起玩，不过也没什么问题啦。

You look 实战 - SpeakingMax英语口语达人

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?

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

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

Every time I drive the steering wheel of my car, I rub off some items. But that's OK, it's still the very same physical object.

每次我使用方向盘时，都会摩擦掉一些微粒，但没关系，它还是原来那个物体。

耶鲁公开课 - 死亡课程节选