/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 vote129 views1 answer
Insertar en una lista anidada python
Python
6 votes123 views1 answer
Check 32 or 64 bit python
Python
5 votes127 views1 answer
Python test is nan
Python
3 votes122 views3 answers
Dot product python
Python
6 votes123 views3 answers
Tkinter filedialog filename
Python
0 vote142 views1 answer
Day 19: interfaces hackerrank solution in python
Python
2 votes117 views1 answer
Tensorflow math python
Python
2 votes117 views1 answer
Covariance matrix python
Python
0 vote127 views1 answer
Spread dictionary python
Python
0 vote133 views3 answers
Django add user to group
Python