/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 vote112 views1 answer
Tqdm 2 progress bars
Python
0 vote140 views3 answers
Django celery email
Python Django
1 vote140 views1 answer
Get current site django
Python
9 votes112 views7 answers
Print python
Python
0 vote108 views1 answer
Csv file sort python
Python
0 vote131 views2 answers
Pairwise swap in data structure in python
Python
0 vote129 views1 answer
Turtle python graphics don't show ubuntu 20.04
Python
91 votes121 views6 answers
How to create a virtual environment in python
Python
1 vote109 views1 answer
Python list index time complexity
Python
-1 vote113 views1 answer
Plotly write html
Python