/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 vote224 views1 answer
Tf.get_variable initializer
Python
1 vote188 views1 answer
Create dataframe from csv and name columns pandas
Python
2 votes193 views2 answers
Drop unamed columns in pandas
Python
0 vote198 views1 answer
Error warning tkinter
Python
0 vote193 views1 answer
Base conversion python
Python
0 vote214 views1 answer
F-string print
Python
35 votes212 views6 answers
Python generate random string
Python
27 votes213 views3 answers
Splitting a string and appending each character to a list python
Python
1 vote200 views2 answers
Change a decimal to time in datetime python
Python
2 votes212 views1 answer
Click js selenium python
Python