This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **3 1 n - 1 C(n,k) number of solutions including + number of solutions not including Total number of solutions is number of solutions including 1 n - 1 C(n-1, k-1) C(n,k) number of solutions including 1 n - 1 C(n-1, k-1) C(n,k) number of solutions not including C(n-1, k) 1 n - 1 C(n-1, k-1) + C(n-1, k) C(n,k) Total number of solutions is 4 int C(int n, int k) { if (k == 0 || n == k) return (1); return (C(n-1, k-1) + C(n-1, k)); } 1 n - 1 C(n,k)...

View
Full Document