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 vote148 views2 answers
Merge a list of dictionaries python
Python
7 votes189 views1 answer
Jupyter install user environment
Python
7 votes137 views5 answers
Install discord python
Python
0 vote154 views1 answer
Datetime column only extract date pandas
Python
3 votes155 views1 answer
Number of rows in dataframe pyspark
Python
0 vote127 views1 answer
Dates and Times in python
Python
0 vote138 views1 answer
Matplotlib radial averaging
Python
6 votes143 views6 answers
Suicide
Python
4 votes153 views1 answer
Python request remove warning
Python
0 vote137 views1 answer
Python [:-1]
Python