Friday, 1 August 2014

Fabonacci Series..

Fibonacci Series

Fibonacci series is in the form of 0, 1, 1, 2, 3, 5, 8, 13, 21,...... To find Fibonacci series we add two previous terms/digits and get next term/number.
Fibonacci Series

Print Fibonacci Series

/**********************************************
      Fibonacci Series
***********************************************/
 #include< stdio.h>
 #include< conio.h> 
 void main()
  {
   int i,no, first=0, second=1, next;
   clrscr();
   first=0;
   second=1;
   printf("Enter nubmer of terms for Series: ");
   scanf("%d",&no);
   printf("Fibonacci series are:\n");
   for(i=0; i < no; i++)
    {
    printf("%d\n",first);
    next = first + second;
    first = second;
    second = next;
   }
   getch();
}
Output
Enter nubmer of terms for Series: 7
Fibonacci series are:
0
1
1
2
3
5
8

No comments:

Post a Comment

No of Occurrence in Array

package com.tutorial4u; import java.util.HashMap; /************************************************************  No of Occurrence in Array...