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 vote167 views1 answer
Floating point python
Python
0 vote164 views1 answer
Standard noramlization
Python
1 vote213 views1 answer
Use incognito in selenium webdriver
Python
0 vote172 views1 answer
Connect a mean value to histogram pandas
Python
4 votes193 views1 answer
Eigenvectors python
Python
0 vote160 views1 answer
How to extract data from telegram using python
Python
16 votes173 views3 answers
Python chunks
Python
0 vote188 views1 answer
Make my own rabbit bomb using python
Python
0 vote172 views1 answer
Write Python programs to print numbers from 1 to 10000 while loops
Python
1 vote187 views1 answer
Jupyter notebook reload module
Python