Can anyone help me write this console program please, Thanks.
I would really appreciate it!
In mathematics, the Fibonacci numbers are the numbers in the following integer sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... By definition, the first two Fibonacci numbers are 0 and 1, and each subsequent number is the sum of the previous two. Some sources omit the initial 0, instead beginning the sequence with two 1s. In mathematical terms:
Fn = Fn-2 + Fn+2
with seed values:
F0 = 0
and
F1= 1
Loading
VulpesPosted Feb 27, 2012, 4:47 PM
http://www.c-sharpcorner.com/Forums/Thread/127366/fibonacci-series-pseudocode.aspx
Shaker AlSalemPosted Feb 27, 2012, 6:38 PM
VulpesPosted Feb 27, 2012, 5:41 PM
Iteration means repeating the same process a number of times but (in normal usage) without using recursion.
So, my solution to the Fibonacci problem uses recursion but the one Vilas linked to uses iteration.
Shaker AlSalemPosted Feb 27, 2012, 5:33 PM
Create two C# methods that will calculate the Fibonacci series. One method using iterations and one method using recursion. The method will take a whole number and return the corresponding element in the series. For Example: Fib(7) = 13 Fib (8) = 21