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 vote194 views1 answer
Syntax of Ternary Operator
Python
4 votes196 views1 answer
Selenium find item by class
Python
0 vote447 views1 answer
Pandas calculate same day 3 months ago dateoffset
Python
0 vote154 views1 answer
Calendly python
Python
1 vote230 views1 answer
Python count variable and put the count in a column of data frame
Python
1 vote195 views1 answer
How to loop back to try except python
Python
0 vote194 views1 answer
Seaborn dot plot hue
Python
1 vote220 views1 answer
Flask authentication user without database
Python Flask
0 vote200 views1 answer
Nsetools index list
Python
0 vote203 views1 answer
Name 'StringType' is not defined
Python