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 vote189 views1 answer
Get processor model in python
Python
0 vote145 views1 answer
Transform dictionary keys python
Python
0 vote160 views2 answers
Quotation marks n string
Python
0 vote131 views1 answer
Http.client.invalidurl: url can't
Python
0 vote144 views1 answer
Quality Control in python
Python
5 votes160 views3 answers
Jupyter dark theme vampire
Python
0 vote146 views1 answer
Django check user admin
Python
8 votes155 views1 answer
Python CSV Has No Attribute 'Writer
Python
0 vote141 views1 answer
How to install package offline
Python
30 votes132 views2 answers
Python clear screen windows and linux
Python