Tree recursive function

>>> def count_partitions(n, m):
        """Count the ways to partition n using parts up to m."""
        if n == 0:
            return 1
        elif n < 0:
            return 0
        elif m == 0:
            return 0
        else:
            return count_partitions(n-m, m) + count_partitions(n, m-1)

Source: composingprograms.com

Similar codes

1 vote260 views1 answer
Find unique values in all columns in Pandas DataFrame
Python
2 votes179 views2 answers
Install python3.7 ubuntu 20.04
Python
32 votes198 views4 answers
Python check if list contains value
Python
0 vote183 views1 answer
Python turn list of strings into list of doubles
Python
10 votes316 views2 answers
Save machine learning model python
Python
0 vote179 views1 answer
Igraph adjacency matrix python
Python
15 votes194 views6 answers
Flask install
Python
2 votes198 views1 answer
Int' object is not callable python
Python
0 vote178 views1 answer
How to print out even index in python
Python
1 vote184 views1 answer
Skip element in list comprehension
Python