Now, as obvious a statement as that is in this algorithm, it turns out that is the key to this whole problem being solved correctly without my algorithm looping infinitely.

这是此算法中很明显的一句话，也是正确解决,整个问题的关键,否则此算法就会陷入死循环。

哈佛公开课 - 计算机科学课程节选

And so the fact that in this whole slide here, this algorithm for sorting, I'm using the verb sort.

在这个排序算法中,我用到了一个动词排序。

哈佛公开课 - 计算机科学课程节选

So this is a nice little search-- sorry, a nice little sort algorithm . And in fact, it's relying on something that we're going to come back to, called the loop invariant.

恩，这是一个很棒的小搜索，抱歉，和很棒的小排序算法，事实上，它依赖于一些我们要回顾的东西,被称作循环不变量。

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

Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.

我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。

哈佛公开课 - 计算机科学课程节选

I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.

我需要得到此算法的时间复杂度,那就明确地给出其,运行时间。

哈佛公开课 - 计算机科学课程节选

So I propose this algorithm, this program, this process for counting people in this room.

因此我提出了这种算法，这种程序和处理方法,来计算教室里的人数。

哈佛公开课 - 计算机科学课程节选

So I propose this as a new algorithm for sorting N elements and being 8 in this case or really a thousand in the case of the phonebook, or anything of larger size.

所以我提出一种新的算法，来解决N个元素的排序问题,在这个问题中N是8，在电话簿的问题中N是一千,或者是大规模的任何问题。

哈佛公开课 - 计算机科学课程节选