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

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

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

Well, you need an algorithm for sorting.

你需要一种排序算法。

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

It is certainly possible, for example, that a quadratic algorithm could run faster than a linear algorithm. It depends on what the input is, it depends on, you know, what the particular cases are. So it is not the case that, on every input, a linear algorithm is always going to be better than a quadratic algorithm.

一个二次平方级复杂度的算法,当然也是可能跑的比线性复杂度算法快的,这取决于，你知道的，输入以及特定的案例，因此并不是对于每个输入,线性复杂度就一定会,比二次平方级复杂度的算法的表现要好,只是通常来说是这样的。

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

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是一千,或者是大规模的任何问题。

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

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是什么呢？

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

But if it watches you over some amount of time just like it's been for years with advertisements, can this kind of algorithm, this kind of process presumably improve?

但是如果它像关注广告一样,花费一些时间关注你，这些算法和进程，想必会提升吧？

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

You might remember vaguely logarithms from high school math and such but what this suggests for us , the computer scientists, is that this is certainly a smarter, a faster algorithm.

你可能还会依稀记得,高中数学里的对数,这就给了我们这些计算机科学家们，一些启示,即，这种算法更智能，更迅速。

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

I think one of the classic ones for strings is called the Rabin-Karp algorithm. And it's simply the same idea that you have a mapping from your import into a set of integers.

我认为字符串哈希,最经典的是Rabin-Karp算法,它只是简单的相同概念,你有一个映射关系将你的输入映射成一组数字。

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

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.

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

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