/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

1 vote215 views1 answer
Difference of two set in python
Python
5 votes209 views1 answer
Pynput.keyboard.Key
Python
40 votes204 views6 answers
Reset index pandas
Python
1 vote204 views1 answer
Webbrowser python could not locate runnable browser
Python
0 vote189 views1 answer
Highlight max value in table pandas dataframe
Python
-2 votes219 views1 answer
Start django project in windows
Python Django
9 votes242 views2 answers
Qrcode.make python
Python
15 votes214 views6 answers
Google translation
Python
0 vote210 views1 answer
Python update flask
Python
0 vote212 views1 answer
Remove words from set if in list python site:stackoverflow.com
Python