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 vote359 views1 answer
Pandas sample rows
Python
0 vote371 views1 answer
How to insert value in admin panel in django
Python
14 votes385 views6 answers
Binary search python
Python
0 vote360 views1 answer
Python find multiple matches in string
Python
0 vote374 views1 answer
Twin axis python
Python
9 votes337 views2 answers
Merge 2 dataframes pythom
Python
2 votes351 views2 answers
Python list to string without brackets
Python
12 votes319 views2 answers
How to shutdown a windows 10 computer using python
Python
2 votes354 views1 answer
Python print dictionary line by line
Python
0 vote354 views1 answer
Python divide string in half
Python