1. Implement the FIBONACCI algorithm 2. Write comments for each line, as you understand 3. Screenshots of three times output, for 8, 11 and 15 OPTION 1 ====================================== /// Find out the Fibonacci series #include void main() { int maxnum, num =0, i; printf("\nEnter the maximum number for Fibonacci series: "); scanf("%d", &maxnum); for(i=1; i<=maxnum; i++) { printf("%d ", fibnumber(num)); num=num+1; } printf("\n\n\n"); return 0; } int fibnumber(int num) { if(num == 0) return 0; else if(num == 1) return 1; else return(fibnumber(num-1)+fibnumber(num-2)); } OPTION 2 ================================== /// Find out the Fibonacci series #include void main() { int maxnum; printf("\nEnter the maximum number for Fibonacci series: "); scanf("%d", &maxnum); printf("%d %d ", 0,1); fibnumber(maxnum-2); printf("\n\n\n"); return 0; } int fibnumber(int num) { static int num1 =0, num2=1, num3; if (num>0) { num3 = num1+num2; num1 = num2; num2 = num3; printf("%d", num3); fibnumber(num-1); } }
1. Implement the FIBONACCI
2. Write comments for each line, as you understand
3. Screenshots of three times output, for 8, 11 and 15
OPTION 1
======================================
/// Find out the Fibonacci series
#include<stdio.h>
void main()
{
int maxnum, num =0, i;
printf("\nEnter the maximum number for Fibonacci series: ");
scanf("%d", &maxnum);
for(i=1; i<=maxnum; i++)
{
printf("%d ", fibnumber(num));
num=num+1;
}
printf("\n\n\n");
return 0;
}
int fibnumber(int num)
{
if(num == 0)
return 0;
else if(num == 1)
return 1;
else
return(fibnumber(num-1)+fibnumber(num-2));
}
OPTION 2
==================================
/// Find out the Fibonacci series
#include<stdio.h>
void main()
{
int maxnum;
printf("\nEnter the maximum number for Fibonacci series: ");
scanf("%d", &maxnum);
printf("%d %d ", 0,1);
fibnumber(maxnum-2);
printf("\n\n\n");
return 0;
}
int fibnumber(int num)
{
static int num1 =0, num2=1, num3;
if (num>0)
{
num3 = num1+num2;
num1 = num2;
num2 = num3;
printf("%d", num3);
fibnumber(num-1);
}
}
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 5 steps with 6 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)