/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

1 vote112 views1 answer
How to make a kivy label multiline text
Python
0 vote87 views1 answer
Sort object by one attribute python
Python
1 vote101 views2 answers
Scikit learn r2 score
Python
103 votes128 views6 answers
Install opencv python
Python
1 vote99 views1 answer
Sort by column dataframe pyspark
Python
0 vote108 views1 answer
Join all words in a list python with space between
Python
0 vote101 views2 answers
Print(), .lower() and .upper() are all different _____________ you can use in python.
Python
0 vote94 views1 answer
How to leave a function python
Python
0 vote99 views1 answer
Time current time python time.time
Python
18 votes98 views3 answers
Get rid of n in string python
Python