And so one of the things we'll look at today is how can we leverage an algorithm, how can we implement an algorithm that at least at first glance the second time we've now seen it feels so obviously better.

因此，今天我们要学习的一点就是,我们怎样才能影响一个算法，怎样实现一个算法,使你在第二次看它时会觉得,至少比你第一次看到它时更好。

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

But I know today in my math class, we were learning about the guys who created RSA Public Key Cryptography.

但是今天的数学课上，我们在学习RSA公钥加密算法的创始人。

积极参与俱乐部活动 - SpeakingMax英语口语达人

They are computationally challenged, meaning, at the time they were invented, they were perfectly good sorting algorithms, there are better ones, we're going to see a much better one next time around, but this is a good way to just start thinking about how to do the algorithm, or how to do the sort.

他们是相当棒的排序算法，是有更好的算法，我们下一次,就会看一个更好的，但是开始想想,如何完成算法，或者说是如何排序,是一个好的学习方法,恩，再试试吧,如何来排序呢？

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

Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.

我们学习过了线性算法，它的典型特征，不是通用的,但是比较典型的特征是，它是逐一减小问题的大小的，或者说是每次减小常数的大小。

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

That's an important observation, and as we get to the part of the course we talk about computational complexity, you'll see that what we really care about is not how efficient the program is on easy problems but how efficient it is on hard problems.

我们已经学习了这门课程的一部分了，我们要开始认识到,计算的复杂度这个概念，你会学习到我们在乎的并不是,算法在简单问题上的工作效率,而是解决复杂问题的效率。

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