There are two possibilities. If the answer is yes, then I'm still looking for the answer, what do I want to do? Well, I don't have to do anything other than change the counter.

这就是一个测试，有两种可能的结果，如果结果为是的话，然后我就要继续找寻目标数,我该怎么做呢？好。

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

Well, I could look at the value here, and compare it to the value I'm trying to find, and say the following; if the value I'm looking for is bigger than this value, where do I need to look? Just here.

然后把它和目标数做个比较，然后做出如下的判断：,如果目标值大于这个值;,那么我应该去哪找呢？对，应该在这里,对不对？不可能在那儿。

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

And in a moment, I'll ask whether it's the best possible explanation, but before we do turn to that question, there is an objection to this entire way of looking at things that's probably worth pausing for a moment and considering.

而马上,我要问你们这是否是最好的解释,但在我们转向那个问题之前,有一个对这一整套,看待问题的方式的反驳,或许值得我们稍微停留并考虑一番

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

It says, right. If j is-- well it says until j is at the less than the length of l-- it says, if min value is bigger than the thing I'm looking at I'm going to do something, all right?

只要j比长度l小,如果MinVal比我要找到元素大，我就要做些什么了,我们来遍历？

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