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 vote311 views2 answers
Fibonacci series python program
Python
0 vote345 views1 answer
First_list = [10,20,30,40] second list = first list second list[3]=400
Python
5 votes312 views1 answer
Python put quotes in string
Python
0 vote289 views2 answers
How to find common characters in two strings in python
Python
0 vote306 views1 answer
Share x axis matplotlib
Python
0 vote328 views1 answer
Pyqt5 qtreewidgetitem enable drop drag
Python
3 votes357 views1 answer
Join two numpy 2d array
Python
1 vote322 views2 answers
Django class based views
Python
1 vote294 views1 answer
Scikit learn ridge classifier
Python
0 vote301 views1 answer
For pyton
Python