quote: Original post by Anonymous Poster
The Fibonacci sequence is recursively *defined*. Just because there is a *direct computational* method for F(n) using the Golden Ratio doesn''t mean it''s a bad example of recursion.
I think it does, and I know a lot of people who agree.
