/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 vote352 views1 answer
How to know python bit version
Python
1 vote355 views1 answer
Missingpy No module named 'sklearn.neighbors.base'
Python
1 vote338 views1 answer
Hide cmd in python
Python
1 vote388 views1 answer
Django filter by category
Python Django
142 votes403 views6 answers
While loop python
Python
22 votes361 views3 answers
Import csv file using pandas
Python
0 vote344 views1 answer
Python package structure
Python
1 vote365 views1 answer
Delete turtle
Python
0 vote400 views1 answer
Btr
Python
0 vote327 views1 answer
Pandas como quitar comillas simples de una columna
Python