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

1 vote202 views1 answer
How to include specific data type from the dataframe
Python
1 vote208 views2 answers
Long in python
Python
0 vote241 views1 answer
Numpy compute min over all axes except
Python
0 vote217 views1 answer
Recorrer diccionario python
Python
0 vote214 views1 answer
Loading in pyqt5
Python
8 votes200 views3 answers
Convert ('a', 'b'): 1 dictionary to a dataframe
Python
0 vote196 views1 answer
Boolean meaning in python
Python
0 vote227 views1 answer
Change my python working directory
Python
35 votes203 views6 answers
Python for loop range
Python
3 votes203 views2 answers
Pyaudio install error ubuntu
Python