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 vote328 views1 answer
Write a python program to find the most frequent word in text file
Python
18 votes313 views5 answers
Python continue
Python
0 vote313 views1 answer
Install python 3.4 mac terminal
Python
37 votes313 views5 answers
Get requests python
Python
0 vote349 views1 answer
From a list of lists - find all length of list
Python
31 votes319 views2 answers
Python requests
Python
0 vote325 views1 answer
Convert pascal annotation to yolo
Python
0 vote317 views2 answers
Python concatenation
Python
30 votes334 views3 answers
Python read scv
Python
39 votes329 views10 answers
Python for loop
Python