The first two terms in the Fibonacci series are 0 and 1, respectively, and each subsequent term is the sum of the previous two. Using
this definition, to calculate the first several terms in the sequence, we get:
0,1, 1, 2, 3, 5, 8, 13, 21, 34, 55,
89,
Build an algorithm for the same
Answers
Answered by
0
Answer:
don't know
Explanation:
don't know sorry sorry sorry
Answered by
1
Answer:
START
1. Take the Number of Terms from the user and store it in Variable N.
2. i = 0
3. j = 1
4. k = 0
5. fib = 0
6. if i < N (Number of Terms) ?
7. if Yes
8. Output "Fibonacci (i) = fib"
9. Output carriage return and linefeed
10. fib = j + k
11. j = k
12. k = fib
13. i = i + 1
14. else
15. end
END
Explanation:
Similar questions