/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 vote133 views1 answer
Convert ascii to binary python
Python
0 vote180 views4 answers
Come traferire file python
Python
1 vote94 views1 answer
Google colab power level
Python
0 vote151 views1 answer
How does sns boxplot determine outliers
Python
0 vote143 views1 answer
Say hello to someone in python
Python
0 vote173 views1 answer
Django bootstrap
Python Django
5 votes102 views7 answers
Pytube python
Python
15 votes159 views3 answers
NAN values count python
Python
26 votes148 views2 answers
Import time in python
Python
2 votes132 views2 answers
How split string in python by size
Python