/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 vote269 views1 answer
Flask send client to another web page
Python Flask
0 vote268 views1 answer
Tkiner lable
Python
1 vote232 views1 answer
How to split a string by colon in python
Python
0 vote221 views1 answer
Define a function in python without arguments
Python
0 vote218 views1 answer
Sum up list python
Python
0 vote244 views1 answer
Django model different schema
Python
0 vote224 views1 answer
RuntimeError: Tensor for 'out' is on CPU, Tensor for argument #1 'self' is on CPU, but expected them to be on GPU
Python
0 vote212 views1 answer
How to see if something is in a class in python
Python
1 vote242 views1 answer
Filter foreign fileds django_filters
Python Django
0 vote228 views1 answer
Slicing time series
Python