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 vote284 views2 answers
Draw bipartite graph networkx
Python
12 votes290 views5 answers
Python find intersection of two lists
Python
0 vote296 views1 answer
Python - subset dataframe based on unique value of a clumn
Python
0 vote299 views1 answer
How to add number in tuple
Python
0 vote270 views1 answer
All classification algorithim compare
Python
0 vote291 views1 answer
Gwt height with tkinker
Python
1 vote281 views1 answer
Loop error in python
Python
6 votes322 views3 answers
Login system in django
Python Django
0 vote296 views1 answer
Old Handler API is deprecated - see https://git.io/fxJuV for details
Python
1 vote286 views1 answer
Pylint: disable=unused-argument
Python