> 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 _______________________________________________ Edu-sig mailing list [email protected] http://mail.python.org/mailman/listinfo/edu-sig
