Posts

Showing posts with the label recursion

Find Factorial using Recursion | C Program:

Image
Write a C Program to Find Factorial User given using Recursion :   About factorial: 5! = 5!x4!x3!x2!x1! = 120 Code: #include<stdio.h> void main() { int facto(int); int n,b; printf("Enter a range of factorial:\n"); scanf("%d",&n); b=facto(n); printf("\nThe factorial of %d is %d",n,b); } int facto(int n) { if(n==1) return n; else n=n*facto(n-1); return n; } Output:

Print Fibonacci Series using Recursion | C program :

Image
Write a C Program to Print Fibonacci series user given range using recursion , C program : Code: #include<conio.h> #include<stdio.h> void main() { int fibo(int); int n,i; printf("Enter the range of fibo:\n"); scanf("%d",&n); for(i=0;i<=n;i++) printf("%d\t",fibo(i)); getch(); } int fibo(int i) { if(i==0 || i==1) return 1; else return (fibo(i-1)+ fibo(i-2)); } Output:

Find GCD using recursion | C program

Image
Write a C Program to find GCD of two user given number using recursion , C program : Code: #include<stdio.h> void main() {     int gcd(int ,int);     int n,b,a;     printf("Enter two  number:\n");     scanf("%d%d",&a,&b);     n=gcd(a,b);     printf("%d",n); } int gcd(int a,int b) {     if(a==b)         return a;     else if(a%b==0)         return b;     else if(b%a==0)         return a;     else if(a>b)         return(gcd(a%b,b));     else         return(gcd(a,b%a)); } Output: