/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 vote172 views1 answer
Python sort a 2d array by custom function
Python
0 vote192 views2 answers
How to terminate a program cv2 python
Python
5 votes216 views2 answers
Who created python
Python
6 votes181 views2 answers
Vscode python multiline comment
Python
4 votes161 views1 answer
Record the amount of time ittales for code to run python
Python
2 votes170 views6 answers
Scikit learn
Python
1 vote184 views1 answer
Combinations and permutations in python
Python
0 vote181 views1 answer
Opencv find image contained within an image
Python
-1 vote182 views2 answers
Python diagonal sum
Python
10 votes179 views4 answers
Create empty numpy array
Python