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 vote223 views1 answer
Como tornar uma string numa lista
Python
0 vote180 views9 answers
Python code checker and corrector
Python
0 vote227 views1 answer
Django pull from Google Sheets
Python
0 vote222 views1 answer
Calculate pearson's r | calculate graph correlation
Python
0 vote202 views1 answer
Python durchschnitt liste
Python
7 votes197 views2 answers
Python numpy matrix to list
Python
4 votes214 views2 answers
Python press any key to continue
Python
2 votes202 views1 answer
Embed variables python
Python
-1 vote216 views2 answers
How to apply lower string dataframe python
Python
4 votes217 views2 answers
Django template for range
Python