Name: 4. (20 pts) Write a function to compute the following: where C(n, i) is th

Question

Name: 4. (20 pts) Write a function to compute the following: where C(n, i) is the number of ways to select i items out of n items. Assume that the following function, combination0, is already written, tested, and available for you to use, and that it computes C(n, i). long combination(int a, int The first line of the function to compute the summation is given below. Complete the rest of the function. This function computes only the summation using the equa- tion above. Assume that n has been passed into the function sumojCombinations from some other calling function (so you don't need to get it from the user), and the results of the summation computation are returned by the function you are writing. long sumofCombinations (int n)

Explanation / Answer

Long sumOfCombinations(int n)

{

Int sum=0;

for(int i=0;i<n+1;i++)

{

int k=combination(n,i);

sum=sum+k;

}

}

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.