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 vote128 views1 answer
X = 10 x += 12 y = x/4 x = x + y in python
Python
1 vote147 views1 answer
List count frequency python
Python
0 vote130 views2 answers
Python add 1
Python
39 votes140 views6 answers
Objects and classes in python
Python
2 votes129 views1 answer
Clear_output jupyter
Python
1 vote141 views2 answers
If number is divisible by 3 python
Python
0 vote128 views1 answer
Gamma distribution python normalized
Python
0 vote133 views1 answer
Adf test python
Python
4 votes139 views1 answer
Video streaming flask
Python
2 votes132 views4 answers
How to mention someone discord.py
Python