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 vote101 views1 answer
Python opencv number of frames
Python
21 votes58 views16 answers
How to convert pandas price column to integer
Python
12 votes102 views4 answers
Unzip file python
Python
0 vote91 views1 answer
Python bubble plot
Python
5 votes103 views4 answers
Prime numbers from 1 to 100 in python
Python
0 vote96 views1 answer
Install python 3.6 dockerfile
Python
2 votes94 views1 answer
Copy website python
Python
1 vote116 views1 answer
Python ascii caesar cipher
Python
-1 vote102 views1 answer
Use linear regression to predict python
Python
98 votes108 views6 answers
Python random choice from list
Python