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 vote343 views1 answer
Rename the console python
Python
3 votes334 views3 answers
Python post request
Python
-1 vote319 views1 answer
Compute Count2(AACAAGCTGATAAACATTTAAAGAG, AAAAA). in python
Python
0 vote356 views2 answers
Python turtle jupyter notebook
Python
2 votes342 views1 answer
User input of int type in python
Python
1 vote329 views1 answer
How to use if else to prove a variable even or odd in python
Python
1 vote303 views1 answer
Fastest sort python
Python
0 vote345 views1 answer
How to convert array to vector in python
Python
11 votes348 views3 answers
Twitter bot python
Python
4 votes343 views4 answers
Median in python
Python