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 vote197 views1 answer
Setting flask app environment variable
Python Flask
0 vote139 views1 answer
Natural language processing with python
Python
36 votes143 views5 answers
Python move file
Python
0 vote156 views1 answer
Django clear _pycache_ command
Python
0 vote186 views1 answer
Corona data with python flask get pdf
Python Flask
0 vote136 views1 answer
How to print 2 list in python as table
Python
0 vote147 views1 answer
Import numpy import cv2 cv2.imshow('image',img) cv2.waitKey(0)
Python
0 vote167 views1 answer
What is te meaning of nested in python
Python
0 vote157 views1 answer
Dict column to be in multiple columns python
Python
2 votes140 views2 answers
Pandas sort by list
Python