This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
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(n1, k1) C(n,k) number of solutions including 1 n  1 C(n1, k1) C(n,k) number of solutions not including C(n1, k) 1 n  1 C(n1, k1) + C(n1, 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(n1, k1) + C(n1, k)); } 1 n  1 C(n,k)...
View
Full
Document
 Spring '09

Click to edit the document details