Startertutorials Blog
Tutorials and articles related to programming, computer science, technology and others.
Subscribe to Startertutorials.com's YouTube channel for different tutorial and lecture videos.

Categories: Others. No Comments on C program to generate the first n terms of Fibonacci sequence
0
(0)

In this article we will learn to implement a C program to generate the first n terms of Fibonacci sequence. A C program is provided below which reads a number and prints the Fibonacci sequence up to n.

 

Program is as follows:

//C program to generate the first n terms of a Fibonacci sequence
#include<stdio.h>
#include<conio.h>
void main()
{
	int n, a, b, c, i;
	printf("Enter a +ve integer: ");
	scanf("%d",&n);
	if(n==1)
		printf("Fibonacci series: 0");
	else if(n==2)
		printf("Fibonacci series: 0 1");
	else if(n>2)
	{
		printf("Fibonacci series: 0 1 ");
		a=0;
		b=1;
		i=3;
		while(i<=n)
		{
			c=a+b;
			a=b;
			b=c;
			printf("%d ",c);
			i++;
		}
	}
	else
		printf("Invalid number!");
	getch();
}

 


Subscribe to our monthly newsletter. Get notified about latest articles, offers and contests.


Input and output of the above program is as follows:

Enter a +ve integer: 10
Fibonacci series: 0 1 1 2 3 5 8 13 21 34

 

How useful was this post?

Click on a star to rate it!

We are sorry that this post was not useful for you!

Let us improve this post!

Tell us how we can improve this post?

Suryateja Pericherla

Suryateja Pericherla, at present is a Research Scholar (full-time Ph.D.) in the Dept. of Computer Science & Systems Engineering at Andhra University, Visakhapatnam. Previously worked as an Associate Professor in the Dept. of CSE at Vishnu Institute of Technology, India.

He has 11+ years of teaching experience and is an individual researcher whose research interests are Cloud Computing, Internet of Things, Computer Security, Network Security and Blockchain.

He is a member of professional societies like IEEE, ACM, CSI and ISCA. He published several research papers which are indexed by SCIE, WoS, Scopus, Springer and others.

Leave a Reply

Your email address will not be published. Required fields are marked *