fibonacci series what Iam is missing ?

[Chris Angelico]

On Tue, Mar 24, 2015 at 3:16 AM, Dave Angel <davea at davea.name> wrote:
> An entirely separate question is whether you can gain performance by caching
> intermediate values.  For example, if you capture values in a list, you
> could potentially save a lot of time, at least for non-trivial values of n.

If you take a step back and seek to print a sequence of Fibonacci
numbers, rather than calculating specific ones based on their indices,
then you don't even need to consider caching. As soon as you've
printed out a number, you move right along.

ChrisA