Task of Challenge #14/54
Print the first 10 Fibonacci numbers without recursion.
Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …
We start with the creation of the for loop. We have to define the loop is running from 2 to 10 in order to get the first 10 numbers. We start with the 0 and the 1 and need 8 more.
Any number n of the Fibonacci series is created by adding up the number n-1 with the number n-2.
To get the third number, we need to have number n-1 and n-2. With n = 3, this will be number 2 and 1 of the series.
The equation is therefore:
n = n – 1 + n – 2;
2 = 1 + 0; The 3rd number of the Fibonacci series.
Then we need to switch the n – 1 and n – 2 to the newly created ones to go further in our Fibonacci series. E voilá, do it as long as you want to get all numbers for the Fibonacci series.
The complete outcome of the console:
Follow me on Instagram and don’t miss the latest Challenge!
Become a bullet proof developer and seek my coding adventures on Udemy
Don’t miss two of my most read Medium Articles
5 Methods that drastically shorten drastically your Code in C# 8.0 by @ArnoldAbrahamP1 https://t.co/UlTW3H7bD9— Kumpulin1 (@kumpulin1) May 5, 2021