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 vote175 views10 answers
Introduction to distutils in python
Python
0 vote195 views1 answer
If function error grepper
Python
0 vote247 views1 answer
Server error 500 heroku django
Python
0 vote235 views1 answer
AttributeError: module 'django.db.models' has no attribute 'ArrayField'
Python Django
3 votes196 views1 answer
Blinking an led with raspberry pi
Python
3 votes190 views2 answers
Pyaudio install error ubuntu
Python
4 votes277 views3 answers
** in python
Python
0 vote206 views2 answers
A problem of predicting whether a student succeed or not based of his GPA and GRE. for logistic regression
Python
0 vote248 views1 answer
Redirect a post request django
Python
0 vote193 views1 answer
Print First 10 natural numbers using while loop
Python