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 vote163 views1 answer
Python win32api setcursorpos
Python
0 vote184 views1 answer
Python list of deeper paths
Python
9 votes203 views2 answers
Find index of sublist in list python
Python
0 vote182 views1 answer
Highlight max value in table pandas dataframe
Python
2 votes195 views3 answers
Building a fibbanaci sequence in python
Python
158 votes297 views3 answers
Traversing dictionary in python
Python
0 vote220 views1 answer
"api_view" is not defined django
Python Django
0 vote296 views1 answer
Flask buildspec.yml
Python Flask
8 votes210 views2 answers
Split range python
Python
17 votes199 views1 answer
Sudo apt-get install python3-tk not working
Python