0
What else can I help you with?
Write a c program that use both recursive and non-recursive functions?
#include<stdio.h> int n fact (int n); int r fact (int n); main() { int n,x,y; printf("enter the number"); scanf("%d",&n); x=nfact(int n); printf("n fact result=%d",x); getch(); } int n fact(int n) { int i,f=1; if(n==0::n==1) return(1); else for(i=1;i<=n;i++) f=f*i; return(f); } int r fact(int n); { if(n==0) return(1); else return(n*r fact(n-1)); }
Factorial of a number using function?
#include<stdio.h> #include<conio.h> int factr(int x); void main() { int a,fact; printf("\n Enter a value: "); scanf("%d",&a); fact=factr(a); printf("\n Factorial: %d",fact); getch(); } int factr(int x) { int f,i; f=1; for(i=x;i>=1;i--) f=f*i; return f; }
Write a program to recursively calculate the factorial of a number?
#include <cstdio> int fact(int x); int main() { int x, total; printf("Enter a number: "); scanf("%d", &x); total = fact(x); printf("The factorial of %d is %d", x, total); char wait; scanf("%s", wait); return 0; } int fact(int x) { if(x == 1) { return 1; } return fact(x - 1) * x; }
How do you write a binomial c program?
#include<stdio.h> int fact(int); void main() { int n,r,f; printf("enter value for n & r\n"); scanf("%d%d",&n,&r); if(n<r) printf("invalid input"); else f=fact(n)/(fact(n-r)*fact(r)); printf("binomial coefficient=%d",f); } int fact(int x) { if(x>1) return x*fact(x-1); else return 1; }
Write a program to print factorial of n numbers starting from x?
In C++: #include <iostream> using namespace std; int fact(int x); int main() { int x, total; cout << "Enter a number: "; cin >> x; total = fact(x); cout << "The factorial of " << x << " is: " << total << endl; char wait; cin >> wait; return 0; } int fact(int x) { if(x == 1) { return 1; } return fact(x - 1) * x; }
Program to find the factorial of a number using recursion?
/*program to find the factorial of a given number*/ #include<stdio.h> #include<conio.h> int fact(int); void main() { int n,c; printf("\n enter the number for which you want to find the factorial"); scanf("%d",&n); c=fact(n); printf("\n the factorial of the number %d is %d",n,fact); getch(); } int fact(int n) { int k; if(n==0) return(1); else k=n*fact(n-1); return(k); }
Algorithm to find factorial using functions?
factorial using recursion style in c++ is unsigned int fact(unsigned int a) { if (a<=1) return 1; else { f*=fact(a-1); return a; } } when using looping structure factorial is unsigned int fact (unsigned int n) { unsigned int i,f=1; for(i=1;i<=n;i++) f*=i ; return f; }
Program in C language to find factorial value Fibonacci valueGCD value using recursion?
#include<stdio.h> #include<conio.h> void main() { int i,fact=1,n; clrscr(); printf("\nEnter the no of terms ="); scanf("%d",&n); for(i=1;i<=n;i++) fact*=i; printf("\nFactorial value for %d terms = %d",n,fact); getch(); }
How can you find factorial of an array?
#include#includevoid main(){int fact(int n);clrscr();printf("%d",fact(5));getch();}int fact(int n){int fact=1;while(n>=1){fact=fact*n;n--;}return fact;}
What is declared?
That is when you declare a variable, outside of any scope, so that any function or similar, can use it. example.... #include<stdio.h> int a=10; main() { int b=20,c; c=a+b; printf("\n%d\t",c); } void fact_num() { int fact=1,i; for(i=1;i<=a;i++) { fact=fact*i; } printf("\n FACTORIAL = %d",fact); }
Algorithm for finding the factorial using iterative function?
// returns n! int fact(int n) { int f_n = 1; for(int i = n; i > 1; --i) { f_n *= n; } return f_n; }
What is global declaration?
That is when you declare a variable, outside of any scope, so that any function or similar, can use it. example.... #include<stdio.h> int a=10; main() { int b=20,c; c=a+b; printf("\n%d\t",c); } void fact_num() { int fact=1,i; for(i=1;i<=a;i++) { fact=fact*i; } printf("\n FACTORIAL = %d",fact); }
