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

25 votes255 views5 answers
Create an env in python
Python
5 votes324 views2 answers
Copy directory from one location to another python
Python
0 vote325 views1 answer
Stackoverflow python random forest
Python
0 vote248 views1 answer
Randint without repitition
Python
0 vote317 views1 answer
Flask return 404
Python Flask
0 vote302 views1 answer
Django composer
Python Django
0 vote272 views1 answer
Calling function whose name is in a variable
Python
3 votes279 views2 answers
Thread with args python
Python
0 vote291 views1 answer
AttributeError: 'QuerySet' object has no attribute django
Python
42 votes309 views6 answers
Pickle dump
Python