Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- public class Program
- {
- public static void Main()
- {
- // 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
- Console.WriteLine(FibonacciA(0));
- Console.WriteLine(FibonacciA(1));
- Console.WriteLine(FibonacciA(6));
- Console.WriteLine(FibonacciB(0));
- Console.WriteLine(FibonacciB(1));
- Console.WriteLine(FibonacciB(6));
- }
- // iterative approach
- public static int FibonacciA(int n)
- {
- var a = 0;
- var b = 1;
- if (n == 0) return a;
- for (var i = 2; i <= n; i++)
- {
- var c = a + b;
- a = b;
- b = c;
- }
- return b;
- }
- // recursive approach w/o memoization
- public static int FibonacciB(int n)
- {
- return n <= 1 ? n : FibonacciB(n - 1) + FibonacciB(n - 2);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement