Python functools

@cache
def factorial(n):
    return n * factorial(n-1) if n else 1

>>> factorial(10)      # no previously cached result, makes 11 recursive calls
3628800
>>> factorial(5)       # just looks up cached value result
120
>>> factorial(12)      # makes two new recursive calls, the other 10 are cached
479001600

Source: docs.python.org

Similar codes

22 votes172 views4 answers
ModuleNotFoundError: No module named 'sklearn.cross_validation'
Python
0 vote152 views1 answer
How to check if a list is a subset of another list
Python
1 vote206 views1 answer
Pyubx
Python
-1 vote205 views1 answer
Http python lib
Python
0 vote152 views1 answer
Make exact copy of an environment
Python
3 votes177 views3 answers
Pd.merge remove duplicate columns
Python
0 vote166 views1 answer
Python does strftime work with date objects
Python
17 votes183 views2 answers
Two loop type python
Python
1 vote173 views1 answer
Jupyter notebook delete the output
Python
1 vote151 views1 answer
Def dft(self, array): stack = Stack() visited = set() stack.append(self) while len(stack) > 0 and while len(visited) >= 0: current = stack.pop() array.append(current) visited.add(current) return array
Python