/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 vote235 views1 answer
@login_required
Python
1 vote214 views2 answers
How to put iput python
Python
0 vote242 views2 answers
Django swagger
Python Django
0 vote233 views1 answer
Get Fiscal year
Python
28 votes223 views2 answers
Python print without new lines
Python
16 votes189 views8 answers
Curl in python
Python
1 vote226 views1 answer
Display cv2 image in jupyter notebook
Python
3 votes222 views1 answer
Spark df shape
Python
0 vote247 views1 answer
Import models
Python
0 vote233 views1 answer
Python ascii art
Python