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

0 vote157 views1 answer
Delete migrations django and start over deployment heroku
Python
0 vote137 views1 answer
Conv2 python
Python
0 vote150 views1 answer
Array must not contain infs or NaNs
Python
0 vote146 views1 answer
Align columns to left pandas python
Python
-1 vote150 views1 answer
Remove zeroes from beginning and end
Python
6 votes139 views2 answers
If file exist in folder then delete in python \
Python
0 vote158 views1 answer
Inverse mask python
Python
2 votes166 views2 answers
Random dice python
Python
0 vote169 views1 answer
Creating a bar plot bar | creating a bar chart
Python
3 votes159 views1 answer
Pandas remove char from column
Python