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

15 votes316 views2 answers
How to play audio
Python
5 votes277 views1 answer
Shift elements in list python
Python
1 vote278 views1 answer
Get random number positive or negative python
Python
2 votes298 views3 answers
Convert csv to dictionary in Python
Python
0 vote263 views1 answer
How to get session value in django template
Python
0 vote277 views1 answer
Print type on each cell in column pandas
Python
0 vote261 views1 answer
How to make default kwargs in python
Python
4 votes272 views2 answers
Python simplify fraction
Python
3 votes288 views1 answer
From collections import defaultdict
Python
0 vote316 views1 answer
Customise the django rest api view
Python Django