Because if you did what I suggested with the list, the time to look up the key would be linear in the length of the list. You'd have to look at each element until you found the key.

字典是用一种很神奇的，叫做散列法的算法,来实现的，后面我们将,会学到一点关于。

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

And we haven't seen all of these sorts, but it's actually quite neat to recognize how different the underlying work is of each of these algorithms.

我们还没有探讨所有的排序算法，但应该很容易区分,每一种算法其内在的,不同之处。

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

PROFESSOR: Great question. So the question is, how do you choose an algorithm, why would I choose to use a pseudo-polynomial algorithm when I don't know how big the solution is likely to be, I think that's one way to think about it.

教授：问得好，所以问题是，你怎样选择算法，为什么当我,不知道解决方案会有多大的时候,我要选伪多项式算法呢，我想这是一种思考问题的方式。

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

And so ease of implementation is actually a very compelling -- metric against which to measure-- -- do you mind toning my voice down a bit-- is a very reasonable measure against which to measure the quality of an algorithm, right.

如此简单的实现实际上是一个很牵强的,度量，与之相对的衡量是-,如果你们不介意，我降低点音量-,是一种用来度量算法质量的,合理的方法。

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

Well, you need an algorithm for sorting.

你需要一种排序算法。

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

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

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