/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 vote188 views1 answer
Python socket set title
Python
0 vote186 views1 answer
Transformer un dictionnaire en liste python
Python
1 vote216 views1 answer
Code for showing contents of a file and printing it in python
Python
1 vote171 views1 answer
AttributeError: module 'keras.optimizers' has no attribute 'RMSprop'
Python
1 vote261 views1 answer
For each value in column pandas
Python
1 vote191 views1 answer
Python print how long it takes to run
Python
0 vote197 views1 answer
Python mixins
Python
4 votes185 views4 answers
Set python3.7 as default ubuntu
Python
0 vote232 views1 answer
How to print a groupby object
Python
0 vote154 views1 answer
Pandas count unique index
Python