What's the point of this? Again, now that I can think about things recursively, I can similarly break things down into simpler versions of the same problem. It could be one version.

这些的意思是什么呢？再一次我想说,我既然能够以递归的方式思考了,那么我就可以简单地把问题,转化为更简单的同类问题。

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

This is actually a piece of code that is really easy to think about recursively and is much more difficult to think about in other ways.

这确实是一段用递归思考起来非常容易,而其它方法特别麻烦的代码,这一段代码的意思就是。

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

All right. So it's fun, and I got a little bit of applause out of it, which is always nice for me, but I also showed you how to think about it recursively.

好，挺有趣的，我也得到了一点掌声，这让我挺高兴的，但是我想让大家明白,怎么用迭代的思想来解决这个问题。

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

Not so easy to see. All right, but this is actually a great one of those educational moments. This is a great example to think recursively. If I wanted to think about this problem recursively- what do I mean by thinking recursively?

看不太出来，好，但实际上是一个有教育意义的时刻,这是一个很好的关于递归的例子,如果我用递归的思想,去考虑这个问题-,我该怎么用递归去解决这个问题呢？

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

And I would suggest palindrome as a great example of that. That's easy to think about recursively. It's much harder to think about iteratively. And you want to get into the habit of deciding which is the right one for you to use. And with that, we'll see you next time.

其它的问题可能用递归的方式,可以更好的解决,而直接思考可能很困难,这时你就得养成做出,正确选择的好习惯了,下周再见。

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

I have used divide and conquer, as we seen before, to recursively break it into smaller problems. But the smaller problem of fib of 4 and the smaller problem of fib of 3 overlap with each other.

正如我们之前看到的，我已经进行了划分,并且递归性的把它分解为更小的问题,但是fib的简化问题,和fib的简化问题会相互重叠。

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