Fibonacci: How to think recursively

Mark Tolonen metolone+gmane at gmail.com
Sun Aug 29 05:07:23 CEST 2010


"Steven D'Aprano" <steve at REMOVE-THIS-cybersource.com.au> wrote in message 
news:4c79c510$0$28655$c3e8da3 at news.astraweb.com...
> On Sat, 28 Aug 2010 16:12:36 -0700, Baba wrote:

> There are other techniques, but this will do to get started.

Once you realize recursion for Fibonacci numbers is still fairly slow, look 
up generator functions :^)

-Mark





More information about the Python-list mailing list