So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.

你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。

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

Now, what we saw last time is there's a brute force solution.

现在，我们上次,看过穷举法解决方案。

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

We're exhausting all possibilities. And then choosing the winner. Well, that's what the slow thief tried. Unfortunately it took so long that before he finished the owner returned home, called the police and the thief ended up in jail.

我们穷举了所有可能方案,然后选择最优方案,这就是动作慢的贼的方案,不幸的是它在失主回家之前，要花上了太长的时间。

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

Brute force, exhaustive enumeration, exactly.

教授：强制算法，穷举法，很对。

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