/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

2 votes266 views1 answer
Matplotlib plot adjust margins
Python
3 votes284 views1 answer
How to connect templates in django
Python Django
3 votes280 views1 answer
The authorization mechanism you have provided is not supported. Please use AWS4-HMAC-SHA256
Python
0 vote258 views1 answer
Stemmer nltk
Python
5 votes267 views3 answers
Correlation python
Python
0 vote248 views1 answer
Collections counter sort by value
Python
0 vote258 views1 answer
Python dict ffrom lists
Python
9 votes246 views4 answers
Pandas count number of rows with value
Python
2 votes292 views1 answer
Django group with permission
Python Django
0 vote280 views1 answer
Text splitter for nlp
Python