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

2 votes175 views2 answers
Audio to text python
Python
1 vote221 views1 answer
How to restart loop python
Python
5 votes293 views1 answer
Q is not defined pylance django
Python Django
-1 vote168 views1 answer
"scrapy shell" pass cookies to fetch
Python
0 vote190 views1 answer
Get most recurring element in a list python
Python
3 votes185 views4 answers
Pip install ffmpeg
Python
30 votes343 views3 answers
How to get decimal part of a double in python
Python
0 vote321 views1 answer
Django float validator
Python Django
1 vote214 views1 answer
Final class variable python
Python
0 vote224 views1 answer
When to use finally python
Python