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

23 votes248 views3 answers
Django rest framework
Python
0 vote256 views1 answer
Python inspect.getsource
Python
0 vote240 views1 answer
Gitpod how to execute python file
Python
0 vote221 views2 answers
Pandas drop a list of rows
Python
0 vote220 views1 answer
Replace string between two regex python
Python
0 vote204 views1 answer
Django admin manytomanyfield filter
Python Django
0 vote264 views1 answer
How to find the summation of all the values in a tuple python
Python
0 vote235 views1 answer
Python string: immutable string
Python
1 vote246 views1 answer
Python synonym library
Python
8 votes244 views2 answers
Split range python
Python