fibonacci series pseudocode

Question

Hey everyone Could someone help me with the above mentioned. I understand that the series means: each number is the sum of the previous 2 e.g 0 1 1 2 3 5 8 13...so 5+8 = 13 3+5 = 8 etc now I came across a numbers of pseudocode examples which I didnt understand so cud u plz explain step by step Thanks.

Vulpes · Answer

Well for some reason my pseudocode tends to end up looking like VB but here it is anyway :) FUNCTION Fibonacci (n As Integer) As Long Integer IF n ERROR - Can't be less than zero ELSE IF n RETURN n // Fibonacci(0) = 0 and Fibonacci(1) = 1 ELSE RETURN Fibonacci(n-1) + Fibonacci(n-2) // sum of previous two Fibonacci numbers (recursive calls) END IF END FUNCTION As an actual C# program this would translate to: using System; public class Test { public static long Fibonacci(int n) { if (n { throw new ArgumentException(Argument can't be less than zero); } else if (n { return n; } else { return Fibonacci(n - 1) + Fibonacci(n - 2); } } static void Main() { for (int i = 0; i { Console.WriteLine(n = {0} => {1} i Fibonacci(i)); } Console.ReadKey(); } }

Avuya Mxoli · Answer

ok thanks now I understand.plz check my other question on prime numbers etc

Vulpes · Answer

Suppose you want to calculate the fifth Fibonacci number. As the sequence is zero based you call the function with an argument of 4 i.e. Fibonacci(4). As this is greater than 1 it is equal to the sum of the previous two Fibonacci numbers so you call the function recursively with arguments of 3 and 2 and add the result together. Now the call to the function with an argument of 2 will cause the function to be called with arguments of 1 and 0. As both these are less than 2 they will return values of 1 and 0 respectively and Fibonacci(2) will therefore return the sum of these which is 1. Similarly the call to the function with an argument of 3 will cause the function to be called with arguments of 2 and 1. As we've seen already Fibonacci(2) returns 1 and Fibonacci(1) returns 1 so Fibonacci(3) returns the sum of these which is 2. So Fibonacci(4) will return the sum of these two branches which is 1 + 2 = 3.

Avuya Mxoli · Answer

thanks Vulpes but I need to understand something...why (n-1) or (n-2)? cud u use a number to just show how it works instead of (n) then show the output as well and thers nothing wrng wth ur pseudocode hey as long as the person reading it understands

Vilas Gite · Answer

hi Mxoli Good Example is there.... with Previous next and Position of Integer. So Its solve your Query. :) http://3acesnetwork.blogspot.com/2010/03/how-to-generate-fibonacci-series-in-c.html -------------------------------------------------------------------------- If this reply solve your post…then  MARK AS ANSWER !