[Solved] Program that counts all the possible PARTS of a number [closed]

by

[ad_1]

For non zero partitions ( imagine boolean separators in array of 1)

2 ** (n-1)

This list would include both 2 + 3 and 3 + 2.

If you allow 0 then infinite.

11

[ad_2]

solved Program that counts all the possible PARTS of a number [closed]