/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 vote123 views1 answer
Node alpine install python
Python
1 vote197 views1 answer
Sum values in django models
Python Django
0 vote165 views1 answer
The following packages have unmet dependencies python3-tornado
Python
3 votes224 views1 answer
Business logic in django
Python Django
0 vote161 views1 answer
Poetry python download windows
Python
0 vote186 views1 answer
Cloud Build Quickstart
Python
0 vote164 views2 answers
Nbconvert python
Python
0 vote164 views1 answer
Intersection of two lists using set method
Python
0 vote166 views1 answer
Python input byte array
Python
0 vote168 views1 answer
Send command civil3D
Python