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 vote252 views3 answers
Program to draw rectangle in python
Python
1 vote242 views1 answer
How to scroll down to end of page in selenium python
Python
0 vote292 views1 answer
Python string remove accent
Python
4 votes267 views2 answers
Django template for range
Python
0 vote283 views1 answer
Django file upload this field is required
Python Django
2 votes259 views1 answer
Pygame rect collisions
Python
11 votes265 views2 answers
__str__()
Python
2 votes285 views1 answer
Convert int to byte python
Python
1 vote268 views2 answers
Django class based views
Python Django
0 vote246 views1 answer
How to save string json to json object python
Python