/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 vote280 views1 answer
Convert multidimentional numpy array to string and back
Python
46 votes291 views6 answers
Add row to dataframe
Python
0 vote297 views1 answer
Automatic stationary conversion
Python
0 vote301 views1 answer
Affinity propagation python
Python
6 votes357 views2 answers
Flask form options
Python Flask
0 vote278 views1 answer
Detailview
Python
2 votes321 views2 answers
Python longest list in list
Python
0 vote297 views1 answer
How to make a dashboard with data representation using python free dash
Python
0 vote249 views0 answer
Python
0 vote268 views1 answer
Korozif
Python