print the n terms of the fibonacci series?

Question

write a program to print the n terms of the fibonacci series?

Abhay Shanker · Answer

int fn = 0; int sn = 1; int tn = 1; Console.WriteLine(Enter limit); int num = int.Parse(Console.ReadLine()); Console.WriteLine(fn); Console.WriteLine(sn); while (true) { tn = fn + sn; if (tn >= num) { break; } Console.WriteLine(tn); fn = sn; sn = tn; } Console.Read();

swap swap · Answer

using System; namespace ForgetCode { public class MainClass { public static void Main() { int x = 0 y = 1 z=0 nth i; Console.WriteLine(

Please Enter The Term Number:); nth = Convert.ToInt32(Console.ReadLine()); for (i = 1; i { z = x + y; x = y; y = z; } Console.WriteLine(
the {0}th term of Fibonacci Series is is {1}

nth z); } } }

Priyank Khare · Answer

Hi puja This is a very basic program. There are lot of websites are available over internet regarding this. Atleast u should have to search over there first. following is your solution- class Program { public static int Fibonacci(int n) { int a = 0; int b = 1; // In N steps compute Fibonacci sequence iteratively. for (int i = 0; i { int temp = a; a = b; b = temp + b; } return a; } static void Main() { for (int i = 0; i { Console.WriteLine(Fibonacci(i)); } Console.ReadLine(); } }

Vulpes · Answer

Here's how you can print the first n terms of the Fibonacci series using recursion : 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() { Console.Write(Enter a number : ); int n = int.Parse(Console.ReadLine()); for (int i = 0; i { Console.WriteLine(n = {0} => {1} i Fibonacci(i)); } Console.ReadKey(); } }