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

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

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

It will probably quit at some point because of space issues, unless I'm writing an algorithm that is using no additional space.

其中一个的时候，它会一直运行下去,它可能在某一处因为空间问题退出,除非我写了一个。

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

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

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