fibo

#include<stdio.h>
 
int main()
{
   int n, first = 0, second = 1, next, c;
 
   printf("Enter the number of terms\n");
   scanf("%d",&n);
 
   printf("First %d terms of Fibonacci series are :-\n",n);
 
   for ( c = 0 ; c < n ; c++ )
   {
      if ( c <= 1 )
         next = c;
      else
      {
         next = first + second;
         first = second;
         second = next;
      }
      printf("%d\n",next);
   }
 
   return 0;
}

Comments

  1. #include
    #include
    int fibbo(int n);
    void main()
    {
    int n,i=0;
    clrscr();
    printf("\n\t enter last no");
    scanf("%d",&n);
    if (n<0)
    {
    printf("\n\t fibo series is not found");
    }
    else
    {
    printf("\n\t fibo series");
    }
    for (i=0;i<=n;i++)
    {
    printf("\n\t %d",fibbo(i));
    }
    getch();
    }

    int fibbo(int n)
    {
    if(n==0)

    return 0;

    else if (n==1)

    return 1;

    else

    return(fibbo(n-1)+fibbo(n-2));
    }

    ReplyDelete
  2. Exp no 2 Fibonacci Series Using Recursion :

    #include
    #include
    int fibbo(int n);
    void main()
    {
    int num,i=0;
    printf("\n\t Enter the Position=");
    scanf("%d",num);

    if(num<0)
    {
    printf("\n\t Cant Calculate fibonacci series:");
    }
    else
    {
    printf("\n \t Fibonacci Series=");

    for(i=0;i<num;i++)
    {
    printf("\t%d",fibbo(i));
    }
    }
    getch();
    }
    int fibbo(int n)
    {
    if(n==0)
    return 0;
    else if(n==1)
    return 1;
    else
    return(fibbo(n-1)+fibbo(n-2));
    }

    ReplyDelete
  3. mayuri magar11:20 AM

    #include
    #include
    int fibbo(int n);
    void main()
    {
    int num,i=0;
    printf("\n\t Enter the Position=");
    scanf("%d",num);

    if(num<0)
    {
    printf("\n\t Cant Calculate fibonacci series:");
    }
    else
    {
    printf("\n \t Fibonacci Series=");

    for(i=0;i<num;i++)
    {
    printf("\t%d",fibbo(i));
    }
    }
    getch();
    }
    int fibbo(int n)
    {
    if(n==0)
    return 0;
    else if(n==1)
    return 1;
    else
    return(fibbo(n-1)+fibbo(n-2));
    }

    ReplyDelete
  4. Bhosale Dhanashri SE312:23 PM

    //Exp no 2 Fibonacci Series Using Recursion :

    #include
    #include
    int fibbo(int);
    void main()
    {
    int num,i=0;
    printf("\n\t Enter the Position=");
    scanf("%d",&num);

    for(i=0;i<=num;i++)
    {
    printf("\t%d",fibbo(i));
    }


    }
    int fibbo(int n)
    {
    if(n==0)
    return 0;
    else if(n==1)
    return 1;
    else
    return(fibbo(n-1)+fibbo(n-2));
    }

    ReplyDelete

Post a Comment