/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 votes147 views2 answers
Python code formatter vs code
Python
0 vote166 views1 answer
Seasonal_decompose python
Python
0 vote224 views1 answer
How to insert item at specifc index python
Python
0 vote171 views1 answer
Unique mark boolean django model field
Python Django
1 vote181 views1 answer
Sleep 5 seconds py
Python
16 votes158 views4 answers
Random.choice
Python
0 vote203 views1 answer
Discord bot python meme command
Python
1 vote144 views1 answer
Flask get value of radio button
Python
0 vote152 views1 answer
Split df coliumn
Python
0 vote134 views1 answer
Python youtube_dl custom path
Python