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

4 votes248 views1 answer
Time.time()
Python
0 vote328 views1 answer
Python Print Variable Using the String Formatting with the help of % character
Python
2 votes300 views1 answer
Selenium change window size
Python
1 vote331 views1 answer
Django round 2 decimal
Python
0 vote305 views2 answers
Python difference between multiprocessing Pool and Threadpool
Python
2 votes297 views1 answer
Discord.py play mp3 file
Python
0 vote303 views1 answer
Shorter Max fonction code in python
Python
8 votes279 views3 answers
Python utf8
Python
1 vote278 views1 answer
Variable inside class not detecting global variable in python
Python
1 vote313 views1 answer
Fourreau de maroquin
Python