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

1 vote158 views1 answer
Truncate add weird symbols in python
Python
0 vote171 views1 answer
How to execute queries with cxoracle python
Python
0 vote199 views1 answer
Django update replace regex
Python Django
0 vote176 views6 answers
ORing two cv mat objects
Python
0 vote182 views1 answer
Pyton get minimum value of array
Python
72 votes150 views6 answers
How to reverse a string in python
Python
145 votes174 views5 answers
Create file python
Python
0 vote237 views1 answer
Nltk hide download messages
Python
0 vote160 views1 answer
Change size of yticks python
Python
0 vote160 views2 answers
I type nano in python and o get error
Python