//PROGRAM USING RECURSSIVE FUNCTION #include int fact(int x) { if(x<=1) return 1; else return(x*fact(x-1)); } int fibo(int x) { if(x<=1) return 1; else return(fibo(x-1)+fibo(x-2)); } void main() { int x,i,n,r,s,ans,ch; char cha; clrscr(); do { clrscr(); printf("1:Fibonancci\n2:Factorial\n3:Binomial Coiefficent\n"); printf("Enter your choice"); scanf("%d",&ch); switch(ch) { case 1: printf("enter the no of terms"); scanf("%d",&x); printf("fibonancci series\n"); printf("0"); for(i=0;i<(x-1);i++) { ans=fibo(i); printf("%2d",ans); } break; case 2: printf("enter no whose factorial is to be calculated"); scanf("%d",&x); ans=fact(x); printf("factorial value=%d",ans); break; case 3: printf("enter the values of n and r :"); scanf("%d%d",&n,&r); if(n