FIBONACCI SERIES PROGRAM IN C

-


In this example , you will learn to print the Fibonacci series upto n terms (entered by user). 

The Fibonacci series is sequence in which next term is the sum of previous two terms. The first two terms of the Fibonacci series are 0 and 1.

The Fibonacci series of first 10 terms is :      
         
0     1      1       2      3     5    8     13    21      34

The next number is found by adding previous two numbers :

         > The third term , which is 1 , is the sum of first two terms 0 and 1.
         > Then 1 +1 =2 , and 2  is the fourth term i.e sum of 2nd and 3rd terms.
         > The 3 is found by adding two numbers before it (1+2).
         >  Then 5 is 2+3 .
         > and so on............


The Fibonacci series program can be written in C in two ways:
          1. Without recursion
          2. With recursion

Fibonacci series program in C without using recursion: 

//fibonacci series without recursion

#include<stdio.h> 
int main( )
{
int n1=0, n2=1, n3, i, number;
printf("Enter the number of elements:");                
scanf("%d",&number);

for(i=0;i <=number;++i)

{
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}

return 0;
} 


Fibonacci series program in C using recursion:

//fibonacci series program in C using recursion


#include
void printFibonacci(int n)
{
static int n1=0,n2=1,n3;

if(n>0) {
n3 = n1 + n2;
n1 = n2;
n2 = n3;
printf("%d ",n3);
printFibonacci(n-1);
}
}

int main( )
{
int n;
printf("Enter the number of elements: ");
scanf("%d",&n);
printf("%d %d ",0,1);
printFibonacci(n-2);      //n-2 because 2 numbers( 0 and 1) are already printed

return 0;
}





Output: 

Enter the number of elements: 10
0  1  1   2   3   5   8   13  21  34


History of Fibonacci :
Fibonacci series was discovered by Leonardo Pisano Bogollo. "Fibonacci " was his name which means "son of Bonacci" . Being famous for  the Fibonacci series , he also helped spread of  Hindu-Arabic numericals (0,1,2,3,4,5,6,7,8,9)   in place of Roman numerals( I, II, III, IV, V  etc.)


Fibonacci Day:
November 23rd, is known as the Fibonacci Day. As it has  ' 1, 1,  2, 3' which is the part of the Fibonacci sequence. 
So, this November 23, let everyone know about it!




Just try this code by your own. If you have any doubts , then feel free to drop a comment . I'll be happy to answer questions in the comment section.
keep coding.






Comments

Post a Comment

Popular posts from this blog

DECIMAL TO OCTAL CONVERSION IN C

-
 In this example, you will learn a program to convert decimal number to its equivalent octal number. Decimal numbers have base 10 , and they use numbers between o to 9. while, Octal  numbers have base 8 , and they use numbers between 0 to 7. ( To understand this program , you should have prior knowledge about decimal to octal conversion. ) Program: //Program to convert decimal number to octal number #include<stdio.h> #include<conio.h> int DectoOct( int num); int main( ) { int num; printf ("Enter a decimal number:"); scanf( "%d" , &num ); printf ("%d decimal number= %d in octal number", num, DectoOct(num) ); return 0; } int DectoOct(int num) { int OctalNumber=0, i=1; while(num !=0) { OctalNumber += (num %8)*i; num /= 8; i*=10; } return OctalNumber; } Output: Enter a decimal number: 10 10 decimal number= 12 in octal number   
Read more

PROGRAM TO CONVERT BINARY CODE TO GRAY CODE

-
Image
 In this example, you will learn a program to convert the Binary code into its equivalent Gray code. (To understand this program , you should have prior knowledge about binary codes , gray codes and its conversion algorithms. ) Here are some examples of binary and its equivalent gray code: Program: //Program to Convert Binary Code to Gray Code #include<stdio.h>  int bintogray(int); int main ( ) { int bin, gray; printf ("Enter a binary number: "); scanf( "%d" , &bin ); gray = bintogray(bin); printf ("The gray code of %d is %d\n", bin, gray); return 0; } int bintogray(int bin) { int a, b, result = 0, i = 0; if (!bin) {      return 0; } else {      a = bin % 10;      bin = bin / 10;      b = bin % 10;      if ((a && !b) || (!a && b))      {          
Read more

KRISHNMURTHY NUMBER PROGRAM IN C

-
 In this example, you will learn a program to check whether entered number is Krishnamurthy number or not. Krishnamurthy Number: A krishnamurthty  number is a number whose sum of the factorial of digits is equal to the number itself.  Let's take one example: Suppose we want to check whether 40585 4! + 0! + 5! + 8! + 5! = 24 + 1 + 120 + 40320 + 120 =40585 i.e. equal to the  number itself. Hence, 40585 is a Krishnamurthy Number. Program: //Program to check whether entered number is krishnamurthy number or not. #include<stdio.h> #include<process.h> int main( ) { int i,n,a,r,c=0,s; printf (" Enter a number : "); scanf( "%d" , &n ); if(n==0) {      printf ("\n %d is not a Krishnamurthy Number.",n);        exit(0) ; } a=n; while(n>0) {      r=n%10;      s=1;      for(i=r;i>=1;i--)           s=s*i;      c=c+s;      n=n/10; } if(c==a) {      printf
Read more