/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

6 votes206 views1 answer
Cors error in flask
Python Flask
0 vote128 views1 answer
Execute command dynamo civid
Python
1 vote97 views1 answer
What is .new() is used in python
Python
-1 vote145 views1 answer
How to make a ip tracker in python
Python
-2 votes132 views1 answer
How to pass function parameter in decorator
Python
0 vote162 views1 answer
Preventing players from changing existing entries in tic tac toe game
Python
3 votes141 views1 answer
Norm complex numpy
Python
12 votes139 views3 answers
Setwd python
Python
8 votes129 views2 answers
Python float print 2 digits
Python
1 vote156 views1 answer
Erreur install pyaudio
Python