[Edu-sig] Re: Idle play

Kirby Urner urnerk at qwest.net
Fri Apr 29 15:32:11 CEST 2005


> I always found that, using only fib(n) as an example of 
> recursion was not very inspiring.
> 
> André

I agree.  Plus the more honest CS books usually let you in on the fact that
the simplest recursive fib algorithms are horribly inefficient, i.e. compute
the same values more than once etc.  A straightforward iterative solution is
better (preferably using a generator ;-D).

Kirby




More information about the Edu-sig mailing list