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 vote156 views1 answer
Python hash md5 unicode
Python
0 vote170 views1 answer
Python get website chrome network tab
Python
0 vote141 views1 answer
Get last “column” after .str.split() operation on column in pandas DataFrame
Python
1 vote153 views1 answer
Create zero array in python
Python
0 vote289 views1 answer
Python dummy command
Python
3 votes165 views2 answers
Cv2.cv2 has no attribute face
Python
3 votes143 views1 answer
Python get day name
Python
0 vote163 views1 answer
Hwoto neglect if any exception happening in python
Python
0 vote142 views3 answers
Detect player command block
Python
-1 vote156 views2 answers
Pandas get column values distinct
Python