You remember last time we were looking at Fibonacci.
2
如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。
And the reason I want to show you this is to notice that the recursion can be doubled.
3
如果你试过了6.7中提到的斐波那契数列，你估计会发现随着参数增大，函数运行的时间也变长了。
If you played with the Fibonacci function from Section 6.7, you might have noticed that the bigger the argument you provide, the longer the function takes to run.
点击反馈