Example
Input
Input number of terms: 10
Output
Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34
Fibonacci series is a series of numbers where the current number is the sum of previous two terms. For Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, … , (n-1th + n-2th)
/**
* C program to print Fibonacci series up to n terms
*/
#include <stdio.h>
int main()
{
int a, b, c, i, terms;
/* Input number from user */
printf("Enter number of terms: ");
scanf("%d", &terms);
/* Fibonacci magic initialization */
a = 0;
b = 1;
c = 0;
printf("Fibonacci terms: \n");
/* Iterate through n terms */
for(i=1; i<=terms; i++)
{
printf("%d, ", c);
a = b; // Copy n-1 to n-2
b = c; // Copy current to n-1
c = a + b; // New term
}
return 0;
}
/*
Output :
Enter number of terms: 10
Fibonacci terms:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34,
*/Program to print Fibonacci series in given range
/**
* C program to print Fibonacci series in given range
*/
#include <stdio.h>
int main()
{
int a, b, c, start, end;
/* Input a number from user */
printf("Enter starting term: ");
scanf("%d", &start);
printf("Enter end term: ");
scanf("%d", &end);
/* Fibonacci magic initialization */
a = 0;
b = 1;
c = 0;
printf("Fibonacci terms: \n");
/* Iterate through terms */
while(c <= end)
{
/* If current term is greater than start term */
if(c >= start)
{
printf("%d, ", c);
}
a = b; // Copy n-1 to n-2
b = c; // Copy current to n-1
c = a + b; // New term
}
return 0;
}
/*
Output :
Enter starting term: 4
Enter end term: 30
Fibonacci terms:
5, 8, 13, 21,
*/