/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 vote271 views1 answer
Dataframe pandas empty
Python
0 vote260 views1 answer
Concatenação de Strings
Python
0 vote252 views1 answer
Numpy collapse last dimension
Python
0 vote271 views1 answer
Change matplotlib fontsize
Python
2 votes342 views4 answers
Show pandas all data
Python
14 votes279 views6 answers
Flask setup
Python
0 vote309 views1 answer
Parallel run of a function with multiple arguments partial
Python
0 vote254 views1 answer
Pattern program in python A aB bCc DdEe
Python
28 votes277 views5 answers
String slicing in python
Python
4 votes278 views1 answer
Dataframe to csv without ids
Python