Develop an algorithm and flowchart to print the first n terms of Fibonacci series.
Answers
Answer:
Fibonacci Series Algorithm:
Start.
Declare variables i, a,b , show.
Initialize the variables, a=0, b=1, and show =0.
Enter the number of terms of Fibonacci series to be printed.
Print First two terms of series.
Use loop for the following steps. -> show=a+b. -> a=b. -> b=show. -> increase value of i each time by 1. -> print the value of show.
End.
Explanation:
Explanation:
Fibonacci Series Algorithm:
Start.
Declare variables i, a,b , show.
Initialize the variables, a=0, b=1, and show =0.
Enter the number of terms of Fibonacci series to be printed.
Print First two terms of series.
Use loop for the following steps. -> show=a+b. -> a=b. -> b=show. -> increase value of i each time by 1. -> print the value of show.
End.
The Fibonacci numbers are generated by setting F0 = 0, F1 = 1, and then using the recursive formula. Fn = Fn-1 + Fn-2. to get the rest. Thus the sequence begins: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, … This sequence of Fibonacci numbers arises all over mathematics and also in nature.
Example: the next number in the sequence above is 21+34 = 55
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, ... Can you