Re: fibonacci series what Iam is missing ?

References	<CACT3xuVF-MOVQK5wSorRSAfpAQEXvS7QsqarACVZKXsQ0bxzpQ@mail.gmail.com> <55103C5D.4070305@davea.name>
Date	2015-03-24 03:59 +1100
Subject	Re: fibonacci series what Iam is missing ?
From	Chris Angelico <rosuav@gmail.com>
Newsgroups	comp.lang.python
Message-ID	<mailman.74.1427129999.10327.python-list@python.org> (permalink)

Show all headers | View raw

On Tue, Mar 24, 2015 at 3:16 AM, Dave Angel <davea@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

Back to comp.lang.python | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

Re: fibonacci series what Iam is missing ? Chris Angelico <rosuav@gmail.com> - 2015-03-24 03:59 +1100
  Re: fibonacci series what Iam is missing ? CHIN Dihedral <dihedral88888@gmail.com> - 2015-03-23 11:39 -0700

csiph-web