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

9 votes148 views2 answers
Django app
Python Django
24 votes115 views2 answers
Python suppress warnings in function
Python
1 vote112 views1 answer
Flask api response code
Python
0 vote149 views1 answer
Start a django project
Python Django
1 vote107 views2 answers
How to map array of string to int in python
Python
0 vote73 views2 answers
Track my location
Python
17 votes110 views2 answers
Python list subdirectories
Python
0 vote119 views1 answer
Django request.data example
Python
0 vote102 views1 answer
Python get portion of dictionary
Python
0 vote139 views1 answer
Mumtiply to matrices python
Python