Write a C Program to calculate Binomial coefficient using Recursion

By | 25.03.2017

C Program to calculate Binomial coefficient

Write a C Program to calculate Binomial coefficient using Recursion. Here’s simple Program to calculate Binomial coefficients using Recursion in C Programming Language.

Recursion : :

  • Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.
  • The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
  • Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Binomial Coefficient

Following are common definition of Binomial Coefficients : :

1) A binomial coefficients C(n, k) can be defined as the coefficient of X^k in the expansion of (1 + X)^n.

2) A binomial coefficients C(n, k) also gives the number of ways, disregarding order, that k objects can be chosen from among n objects; more formally, the number of k-element subsets (or k-combinations) of an n-element set.

Problem : :

Write a function that takes two parameters n and k and returns the value of Binomial Coefficient C(n, k). For example, your function should return 6 for n = 4 and k = 2, and it should return 10 for n = 5 and k = 2.

Below is the source code for C Program to calculate Binomial coefficient using Recursion which is successfully compiled and run on Windows System to produce desired output as shown below :


/* C Program to calculate Binomial coefficient using Recursion */

int BC(int n, int k);

int main()
        int n,k;
        printf("Enter n and k : ");
        printf("%\nBinomial coefficient\n",BC(n,k));

        return 0;

int BC(int n, int k)
        if(k==0 || k==n)
                return 1;
        return BC(n-1,k-1) + BC(n-1,k);


************* OUTPUT **************

************* FIRST RUN ***********

Enter n and k :

Binomial coefficient

************* SECOND RUN ***********

Enter n and k :

Binomial coefficient

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach upto you in the short interval.

Thanks for reading the post….

3.7 19 votes
Article Rating
Category: C Programming Recursion Programs Tags:

About Tunde A

My name is Tunde Ajetomobi, a Tech Enthusiast and Growth Hacker. I enjoy creating helpful content that solves problem across different topics. Codezclub is my way of helping young aspiring programmers and students to hone their skills and find solutions on fundamental programming languages.

Notify of

Inline Feedbacks
View all comments