/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

3 votes132 views1 answer
Pygame unable to open file mp4
Python
1 vote164 views3 answers
Pandas rename index values
Python
0 vote128 views1 answer
Pip install --upgrade pip no module named pip
Python
5 votes188 views1 answer
Shift elements in list python
Python
11 votes178 views2 answers
Find character in python
Python
0 vote187 views1 answer
Countplot for different classes in a column
Python
0 vote166 views2 answers
Python selenium switch to window
Python
7 votes157 views2 answers
Python prime check
Python
0 vote166 views1 answer
Tree recursive function
Python
4 votes163 views2 answers
Chrome driver download for selenium python
Python