And the obvious question I could start with is, and suppose I ask you, how long does the algorithm implemented by this program take to run?

我开始这个话题的第一个问题是，假设我问你，由这个算法实现的程序大概,要运行多久才能给出答案？

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

And probably the obvious thing you'll think about is, we'll come up with a clever algorithm. And I want to disabuse you of that notion.

可能你想到的最有效的方法,就是设计一个,聪明点的算法了,这正是我想你们注意到的。

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

We saw this with the sock algorithm a moment ago.

我们前面看到了袜子算法。

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

We'll start with the greedy thief. Well, the greedy thief follows the greedy algorithm.

我们从贪婪的贼开始,这个贪婪的贼按贪婪算法行动。

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

But in general, it's hard to come up with the really clever algorithm.

但是通常来讲，真正巧妙的算法,确实非常难设计。

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

> So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.

虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样，你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。

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