/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

4 votes154 views3 answers
Generate random list of number py
Python
10 votes153 views2 answers
Python list to set
Python
1 vote140 views1 answer
Python - count the frquency of a vlaue in a coulmn
Python
0 vote156 views1 answer
Proj 4.9.0 must be installed.
Python
-1 vote192 views9 answers
Django for Beginners
Python Django
0 vote155 views1 answer
Django create object with default today date
Python
65 votes189 views5 answers
Convert date to datetime python
Python
-1 vote172 views3 answers
Open csv from url python
Python
0 vote147 views2 answers
Split pdf in python
Python
0 vote172 views1 answer
ModuleNotFoundError: No module named 'rest_auth'
Python