Recursion example

  1. C Program to find the factorial of given number.

#include<stdio.h>

#include<conio.h>

int main()

{

    int i,f=1,n;

    printf("Enter the factorial number.");

    scanf("%d",&n);

    for(i=1;i<=n;i++)

    {

        f=f*i;

    }

    printf("The factorial of %d is %d",n,f);

    return 0;

}

2. C Program to find the factorial using recursion.

#include<stdio.h>

#include<conio.h>

int fact(int n);

int main()

{

    int x,f;

    printf("Enter the number whose factorial you want to find?");

    scanf("%d",&x);

    f=fact(x);

    printf("The factorial of %d is %d",x,f);

    return 0;

}

int fact(int n)

{

    if(n==1)

    {

        return 1;

    }

    else if(n==0)

    {

        return 0;

    }

    else

    {

        return (n*fact(n-1));

    }

}

3. Write a C program to find the fibonacci series.

#include<stdio.h>

int main()

{

    int a,b,c,i;

    printf("Enter the two number?");

    scanf("%d%d",&a,&b);

    printf("The fibonacci series are as follows \n");

    for(i=1;i<=5;i++)

    {

        printf("%d \n",a);

        c=a+b;

        a=b;

        b=c;

    }

    return 0;

}

4. Write a C program to find fibonacci series using recursion.

#include<stdio.h>

int fib(int );

int main()

{

    int i,n;

    printf("How many times of fibonacci series you want to see??");

    scanf("%d",&n);

    printf("The fibonaci series are..\n");

    for(i=1;i<=n;i++)

    {

        printf("%d\n",fib(i));

    }

    return 0;

}

int fib(int n)

{

    if(n==1)

    {

        return 1;

    }

    else if(n==2)

    {

        return 2;

    }

    else

    {

        return fib(n-1)+ fib(n-2);

    }

}