Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
C Program to find Binomial coefficients without using recursion
#include<stdio.h>
void main() {
int i, j, n, k, min, c[20][20]={0};
printf("\n Enter the value of n: ");
scanf("%d", &n);
printf("\n Enter the value of k: ");
scanf("%d", &k);
if(n >= k) {
for(i=0; i<=n; i++) {
min = i<k? i:k;
for(j = 0; j <= min; j++) {
if(j==0 || j == i) {
c[i][j] = 1;
} else {
c[i][j] = c[i-1][j-1] + a[i-1][j];
}
}
}
printf("%d\t",c[i][j]);
printf("\n");
} else {
printf("\n Invalid input \n Enter value n>=k \n");
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.