C Exercises: Display the first n terms of Fibonacci series
C For Loop: Exercise-35 with Solution
Write a program in C to display the first n terms of the Fibonacci series.
The series is as follows:
Fibonacci series 0 1 2 3 5 8 13 .....
Pictorial Presentation:

Sample Solution:
C Code:
#include <stdio.h>
void main()
{
int prv=0,pre=1,trm,i,n;
printf("Input number of terms to display : ");
scanf("%d",&n);
printf("Here is the Fibonacci series upto to %d terms : \n",n);
printf("% 5d % 5d", prv,pre);
for(i=3;i<=n;i++)
{
trm=prv+pre;
printf("% 5d",trm);
prv=pre;
pre=trm;
}
printf("\n");
}
Sample Output:
Input number of terms to display : 10 Here is the Fibonacci series upto to 10 terms : 0 1 1 2 3 5 8 13 21 34
Flowchart:

C Programming Code Editor:
Improve this sample solution and post your code through Disqus.
Previous: Write a program in C to find the prime numbers within a range of numbers.
Next: Write a program in C to display the such a pattern for n number of rows using a number which will start with the number 1 and the first and a last number of each row will be 1.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
C Programming: Tips of the Day
What does (x ^ 0x1) != 0 mean?
The XOR operation (x ^ 0x1) inverts bit 0. So the expression effectively means: if bit 0 of x is 0, or any other bit of x is 1, then the expression is true.
Conversely the expression is false if x == 1.
So the test is the same as:
if (x != 1)
and is therefore (arguably) unnecessarily obfuscated.
Ref :https://bit.ly/2NIisQM
- Weekly Trends
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises
We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook