On Tuesday we'll talk about a different way to implement Fibonacci, where the growth will be much less dramatic. Thank you.
周二我们将会讲一种,不同的Fibonacci数列解决方案,这个方案的增长会小得多,谢谢。
You remember last time we were looking at Fibonacci.
你还记得上次我们在研究斐波那契数列吧。
Nobody in their right mind actually implements a recursive Fibonacci the way I did it originally.
没有谁真的在右脑中,按我最初讲的递归方法,计算Fibonacci数列。
应用推荐