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 vote106 views1 answer
Final class variable python
Python
0 vote113 views1 answer
ConversionofDatatypes-I
Python
0 vote105 views2 answers
Select list of columns pandas
Python
0 vote97 views1 answer
Python how to invert an array
Python
1 vote53 views1 answer
Reverse slice python
Python
1 vote110 views1 answer
.annotate unique distinct
Python
11 votes96 views2 answers
__str__()
Python
0 vote96 views1 answer
Escape brackets in regex python
Python
74 votes108 views9 answers
Online python compiler
Python
0 vote144 views1 answer
Flask debugtoolbar
Python Flask