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 vote334 views1 answer
Pandas groupby histogram
Python
0 vote343 views1 answer
Performance of extend vs append loop
Python
3 votes356 views1 answer
Pandas reciprocal
Python
0 vote346 views1 answer
How to return only fractional part in python
Python
0 vote349 views1 answer
Python first two numbers
Python
0 vote365 views2 answers
Python using dll
Python
0 vote348 views1 answer
Convert_text_to_hexadecimal_viva.py in python
Python
0 vote332 views2 answers
Python compare timestamps
Python
22 votes370 views4 answers
Python get date next week
Python
1 vote341 views1 answer
Warning: this is a development server. do not use it in a production deployment.
Python