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 vote122 views1 answer
Reorder list python
Python
0 vote118 views1 answer
Failed to build wxPython
Python
0 vote119 views1 answer
Python is program running
Python
0 vote146 views1 answer
Search bar python program
Python
0 vote120 views1 answer
Seaborn heatmap spearman correlation coefficient
Python
0 vote119 views1 answer
Math domain error python
Python
0 vote121 views2 answers
Plt.text background alpha
Python
25 votes196 views3 answers
Startapp django
Python Django
0 vote116 views1 answer
Python jupitor
Python
0 vote120 views1 answer
Python add datetime to filename
Python