Question

1. The Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, 21 … begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. Write a non-recursive function Fibonacci (n) that calculates the nth Fibonacci number. Write a program to display a table of terms and the Fibonacci number in two columns for the first 15 terms, using the function you created.

Answer 1

Code:

#include<stdio.h>
int fibno(int n)
{
   int f1=0,f2=1,i;/*Declared variables*/
   if(n==0)
   {
       return 0;/*When n is 0 we return 0*/
   }
   else if(n==1)
   {
       return 1;/*When n is 1 we return 1*/
   }
   else
   {
       int sum;
       for(i=1;i<n;i++)
       {/*Here we calculate the fibnocci series*/
           sum=f1+f2;
           f1=f2;
           f2=sum;
       }
       return sum;
       /*Finally we return the number*/
      
   }
  
}
int main()
{
   int i=1,n=15;/*Here we declared the variables*/
   printf("First 15 Fibonacci series: \n");
   for(i=0;i<n;i++)
   {
       printf("%d\t%d\n",i+1,fibno(i));
       /*Here we call the function for every number*/
   }
}

Output:

indentation: