/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 vote323 views1 answer
How to bubble search in python stack overflow
Python
0 vote320 views1 answer
How to run same function on multiple threads in pyhton
Python
0 vote304 views1 answer
Python append to tuple list
Python
5 votes306 views2 answers
Filter dataframe with list
Python
1 vote319 views1 answer
Pandas string does not contain
Python
0 vote299 views1 answer
Eia api python
Python
0 vote330 views1 answer
Django admin no such table user
Python Django
0 vote287 views1 answer
Drop colums whoose value are object type in python
Python
0 vote265 views1 answer
Pandas make new dataframe
Python
33 votes280 views6 answers
Convert list to string
Python