Once you hear that description, it's easy to write the code, in fact. This is a place where the recursive version of it is much easier to think about than the iterative one.

实际上一旦你听到了大致描述,就能很轻松的写出代码来,在这一点上应用递归来解决问题,比用迭代要容易理解多了。

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

We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.

我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。

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

Whether it was recursive or iterative.

但是在这个问题里。

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