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 vote137 views1 answer
Wie printe ich in python
Python
12 votes173 views6 answers
Python convert date to timestamp
Python
0 vote172 views1 answer
Show post id on django admin interface
Python Django
76 votes156 views6 answers
Main in python
Python
12 votes154 views3 answers
Screen size python
Python
0 vote144 views1 answer
Tuple: Create tuple
Python
1 vote155 views3 answers
Sum method in python
Python
0 vote141 views1 answer
Django blog new post
Python
0 vote264 views1 answer
Python mad libs
Python
0 vote168 views1 answer
Python intitialize a 2d matrix
Python