We follow the same recursive analysis of the problem as we did while counting:
partitioning n using integers up to m involves either
- partitioning n-m using integers up to m , or
- partitioning n using integers up to m-1 .
For base cases, we find that 0 has an empty partition, while partitioning a
negative integer or using parts smaller than 1 is impossible.
If you want to change selection, open document below and click on "Move attachment"
|status||not read|| ||reprioritisations|
|last reprioritisation on|| ||suggested re-reading day|
|started reading on|| ||finished reading on|