[hindi] Algoritham Of fibonacci series
Q : How to find Algoritham Of fibonacci sequnace ?
A: Fibonacci series is defined as a sequence of numbers in which the first two numbers are 1 and 1, or 0 and 1, depending on the selected beginning point of the sequence, and each subsequent number is the sum of the previous two. So, in this series, the nth term is the sum of (n-1)th term and (n-2)th term. In this tutorial, we’re going to discuss a simple algorithm and flowchart for Fibonacci series along with a brief introduction to Fibonacci Series and some of its important properties.
Before taking you through the source code in Fibonacci Series Algorithm and Flowchart, first let me explain few things about this wonderful series...
How to Generate Fibonacci Series?
First Term = 0
Second term = 1
Third Term = First + Second = 0+1 =1
Fourth term = Second + Third =1+1 = 2
Fifth Term = Third + Fourth = 2+1 = 3
Sixth Term= Fourth + Fifth = 3+2 = 5
Seventh Term = Fifth + Sixth = 3+5 = 8
Eighth Term = Sixth + Seventh = 5+8 = 13 … and so on to infinity!
______________________________________________________________________________________________________________________________________________________________________________________
Hope it helps.
Please correct me if i am wrong at any point.
Thanks for watch video.
LIKE SHARE & SUBSCRIBE
~ mr improver