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 vote125 views1 answer
Json python no whitespace
Python
2 votes137 views3 answers
How to use readline in python
Python
1 vote133 views1 answer
How to use query_params in get_object djangorestframework
Python
0 vote138 views1 answer
Python console width
Python
1 vote126 views1 answer
How to multiply in django template
Python
14 votes133 views2 answers
Python list of random values
Python
0 vote127 views1 answer
Dataflair python
Python
0 vote124 views1 answer
Ec2 ssh terminal hangs after sometime
Python
3 votes143 views3 answers
Pytest
Python
0 vote117 views1 answer
Create new column with mask pandas
Python