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

19 votes257 views5 answers
Pandas dataframe column names
Python
2 votes243 views5 answers
Check boolean python
Python
0 vote250 views1 answer
Numpy convert 1d to 2d
Python
7 votes238 views2 answers
Python list 1 to n
Python
0 vote241 views9 answers
Word generator in python
Python
1 vote252 views3 answers
Python venv flask
Python
0 vote253 views1 answer
Self.find_by_id
Python
7 votes261 views2 answers
Whatapp
Python
0 vote287 views1 answer
Python multi-line statement
Python
0 vote251 views1 answer
Drop colums whoose value are object type in python
Python