| Java: |
private static int partition(int n, int k) {
if (k > n) return 0; else if (k == n) return 1; else if (k == 0) return 0; else return partition(n - 1, k - 1) + partition(n - k, k); } |
Can anyone explain to me how this recursive method returns the number of ways n can be written as a sum of k positive integers???
I don't understand why the sum of the ways n-1 can be written as k-1 integers and n-k can be written as k integers are equal to the ways that n can be written as k integers.
Thanks!!!
Mod Edit: Remember to use syntax tags! Thanks
| code: |
[syntax="java"]Code Here[/syntax] |