/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 votes140 views2 answers
Python literal string
Python
1 vote165 views1 answer
Change index function for class python
Python
9 votes151 views3 answers
How to join tables in python
Python
234 votes529 views6 answers
Random in python
Python
0 vote183 views1 answer
Save file in windows hidden folder python
Python
3 votes145 views2 answers
Copy a 2d array in python
Python
10 votes155 views10 answers
Apple
Python
2 votes173 views2 answers
Pandas create column from another column
Python
1 vote152 views1 answer
Python install pandas for linux
Python
1 vote198 views1 answer
R vs python
Python