/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 vote168 views1 answer
Autoscrapper installation
Python
0 vote175 views2 answers
Pyqt close window
Python
1 vote160 views1 answer
Python load pandas from pickle
Python
0 vote146 views1 answer
Module installed but not found python
Python
0 vote165 views1 answer
Python catch print
Python
45 votes244 views3 answers
Online matplotlib compiler
Python
1 vote161 views1 answer
Make csv lowercase python
Python
4 votes161 views3 answers
Pandas extract month year from date
Python
0 vote182 views1 answer
One small letter three big bodyguard
Python
7 votes167 views3 answers
Lambda and function in python
Python