Write a recursive function to calculate binomial coefficients. This function sho

Question

Write a recursive function to calculate binomial coefficients. This function should take in two integer arguments, n and k, and will return an integer.

The simplest way to write this code is to have a function named binomial_coefficient() that returns the integer that represents the binomial coefficient.

The function will need to check if n is equal to k (and return 1), if k equals 0 (and return 1), or if we need to recursively call the binomial_coefficient function. n should be greater than or equal to zero and k should be greater than or equal to zero AND less than or equal to n.

Explanation / Answer

#include using namespace std; int binomial(int n, int k) { int value = 0; if (k == 0 || k == n) return 1; else { value = value + (binomial(n-1,k-1) + binomial(n+1,k)); } return value; } /* * Function: main() * Description: Test driver for the h() functoin. */ int main(int argc, char **argv) { cout

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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