A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence.
Formula:
let t1, t2,............... tn
be terms in fibinacci sequence
t1 = 0, t2 = 1
tn = tn
- 2 + tn - 1......... where n > 2
Algorithm:
Step 1: Start
Step 2: Read a, b, sum,n values
as integers
Step 3: Set a as 0 and b as 1
Step 4: for
counter: 2 to no increment counter by 1 begin
sum ← a + b;
Print sum a ← b;
b ← sum;
end
Step 5: Stop.
DF PROGRAM:
#include<stdio.h>
#include<conio.h>
void main()
{
int a = 0, b = 1, n = 0, i, sum = 0;
clrscr();
printf("Enter the length of series: \n ");
scanf("%d", &n);
printf("\n Fibonacci series:\n");
printf("%d\t %d", a, b);
for(i = 2; i < n; i++)
{
sum = a + b;
printf(" \t%d",sum);
a = b;
b = sum;
}
getch();
}
OUTPUT:
Enter the length of series:
8
Fibonacci series:
0 1 1 2 3 5 8 13
Comments
Post a Comment