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.

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

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

This is another way of doing exponentiation, but this one's a recursive function. All right?

但这是一种递归的方法对不对？,好，让我们看看这种方法？

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

So now, let's recurse together, let's dive in and hone in on what T of 8 is.

下面用递归的方法继续,看看T是多少。

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

Nobody in their right mind actually implements a recursive Fibonacci the way I did it originally.

没有谁真的在右脑中,按我最初讲的递归方法,计算Fibonacci数列。

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