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

4 votes204 views3 answers
Using a print function
Python
0 vote188 views1 answer
Pandas nat to null?
Python
0 vote256 views1 answer
Check if a date is reached django
Python Django
2 votes196 views4 answers
How to count special values in data in python
Python
0 vote211 views1 answer
Python GUI kivvy
Python
0 vote216 views1 answer
Get array from h5py dataset
Python
0 vote185 views1 answer
Blender python save file
Python
6 votes206 views2 answers
Get_or_create django
Python Django
0 vote202 views1 answer
How to get device hwid cmd
Python
0 vote203 views1 answer
Pandas groupby and show specific column
Python