/Python/Most efficient fibonacci number algorithm

Most efficient fibonacci number algorithm

>>> def fib(n, computed = {0: 0, 1: 1}):
...     if n not in computed:
...         computed[n] = fib(n-1, computed) + fib(n-2, computed)
...     return computed[n]

Source: stackoverflow.com

Most efficient fibonacci number algorithm

>>> def fib_to(n):
...     fibs = [0, 1]
...     for i in range(2, n+1):
...         fibs.append(fibs[-1] + fibs[-2])
...     return fibs
...

Source: stackoverflow.com

Similar codes

0 vote352 views1 answer
Response.url SSL warning python
Python
0 vote276 views1 answer
How to make a minute counter in python
Python
0 vote310 views1 answer
How can item in list change in int in python
Python
0 vote263 views1 answer
How are strings stored internally in python 3
Python
17 votes266 views2 answers
Python filter data from list
Python
3 votes255 views4 answers
Tkinter maximize window
Python
0 vote292 views2 answers
Import static
Python
1 vote260 views1 answer
Remocve pyc files
Python
4 votes296 views3 answers
Round down decimal python
Python
-1 vote282 views2 answers
Generate bar plot python
Python