Problem Analysis:
The problem is to display the Fibonacci series of last term upto 300.
Algorithms:
1.start.
2.Declare i,f=0,s=1,n.
3.n=f+s.
4.print f,s,n.
5.stark:
for (i=1;i<100;i++)
{ f=s;
s=n;
n=f+s;
if (n<300)
{ printf(“\f%d”,n);
go to stark
}
else goto step 6
6.Stop
Codes:
Outputs:
Compiling , Debugging and Testing
0 1 1 2 3 5 8 13 21 34 55 89 144 233