Question

Write a C program solution to implement a recursive version of binomial coefficients.

Note - the binomial coefficients B(n, k) satisfy the recursive formula
B(n, k) = B(n − 1, k − 1) + B(n − 1, k).
Together with the initial conditions B(n, 0) = B(n, n) = 1 the formula can be used to calculate all binomial coefficients

Answer 1

#include<stdio.h>

int B(int n, int k)

{

if (k==0 || k==n)

return 1;

return B(n-1, k-1) + B(n-1, k);

}

int main()

{

int n = 5, k = 2;

printf("Binomial Coefficient is %d\n", B(n, k));

return 0;

}