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 vote362 views1 answer
Plt line of best fit
Python
4 votes379 views3 answers
E: Unable to locate package python3-pip
Python
6 votes396 views2 answers
Lofi hip hop radio online
Python
0 vote375 views2 answers
Python book
Python
0 vote369 views1 answer
Remove 0 from date in python
Python
2 votes362 views1 answer
How to add headers in csv file using python
Python
1 vote359 views1 answer
How to change the color of command prompt in python
Python
0 vote357 views1 answer
Python hide print output
Python
9 votes366 views2 answers
TypeError: 'method' object is not subscriptable
Python
4 votes364 views2 answers
How to print a word in different line in python
Python