这里体现了斐波纳契数列结果。

Here the Fibonacci Outgrowth is represented.

youdao

你还记得上次我们在研究斐波那契数列吧。

You remember last time we were looking at Fibonacci.

youdao

他当时使用的例子，就是用递归生成一个斐波那契数列。

The example he USES is a function that generates a Fibonacci sequence.

youdao

STUDENT: Right, we're going to do that in a second, but the answer is Fibonacci numbers, we define the first two.

学生：听不见：,我们马上会试一试，但是答案是斐波那契数列，我们可以定义下最初的两个数。

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

Which actually is son of Bonacci which is the name of his father who was apparently a very friendly guy. First of all, does anyone know what a Fibonacci number is? Wow.

斐波纳契，它是波纳契的儿子,波纳契是它父亲的名字,听上去是个友好的男人不是吗,谁知道斐波纳契数列？

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

And the reason I want to show you this is to notice that the recursion can be doubled.

如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。

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