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

0 vote296 views1 answer
How to check if a cell is empty in openpyxl
Python
39 votes278 views6 answers
Pandas drop rows with nan in a particular column
Python
6 votes271 views4 answers
What is a python module
Python
0 vote241 views2 answers
Python remove empty lines
Python
6 votes291 views1 answer
Python regex replace all non alphanumeric characters
Python
0 vote288 views1 answer
Get UTC time for IST time python
Python
16 votes282 views1 answer
Which folder python os
Python
234 votes551 views6 answers
Random in python
Python
0 vote276 views2 answers
Java to python conversion
Python
-1 vote312 views2 answers
How to declare tuple in python
Python