/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

46 votes296 views5 answers
How to check uppercase in python
Python
1 vote137 views1 answer
How to close python with a line of code
Python
2 votes197 views3 answers
Find difference between two pandas dataframes
Python
0 vote131 views1 answer
Python set grid thickness
Python
0 vote205 views1 answer
Extract bounding boxes OpenCV
Python
91 votes144 views6 answers
Sort df by column
Python
0 vote131 views1 answer
Pandas column by index
Python
0 vote131 views1 answer
Try for loop python
Python
-1 vote142 views1 answer
Discord api python putting ids in a list
Python
5 votes141 views2 answers
Python 3 replace all whitespace characters
Python