What's the complexity of this decision tree solution? Well, in the worst case, we're enumerating every possibility of in and out.

决策树解决方法的复杂度是多少？,在最糟的例子中得列举，所有可能的输入和输出。

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

So if you think about the way something like, say, Mapquest works, and last week in recitation you looked at the fact that shortest path is exponential.

所以如果你想想电子地图，还有上周学的列举法,你就会发现一般最简单的方法,都是指数递增的。

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