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

6 votes119 views1 answer
Check 32 or 64 bit python
Python
2 votes114 views1 answer
Python tkinter underline text
Python
0 vote116 views1 answer
Python txt to parquet
Python
4 votes93 views3 answers
Infinite while loop in python
Python
0 vote118 views1 answer
Django bootstrap
Python
0 vote119 views1 answer
Hover 777-286
Python
0 vote144 views1 answer
Make a tuple
Python
0 vote154 views1 answer
How to delete all instances of a model in django
Python Django
0 vote128 views6 answers
Convert from python code to c++ code
Python
54 votes118 views3 answers
Getting size of list in python
Python