/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 vote236 views1 answer
Ipython list command history
Python
13 votes237 views3 answers
Python dynamic variable name
Python
3 votes266 views2 answers
Select categorical columns pandas
Python
0 vote224 views1 answer
Python tupel from string
Python
0 vote263 views2 answers
How to delete blank rows from text file in spyder
Python
0 vote252 views3 answers
Pandas python tutorial
Python
4 votes247 views1 answer
Np array value count
Python
2 votes260 views1 answer
How to set google chrome as default browser when coding with python using webbroiwser module
Python
44 votes249 views2 answers
Repl.it python
Python
1 vote286 views1 answer
Export_excel file python
Python