Fibonacci C# - c# - c# tutorial - c# net



Related Tags: kurs c# , c# programmieren , tutorial c# visual studio , learn programming with c# , c# kurs online , the best way to learn c# , c# tutorial for complete beginners from scratch , tuto c# , manual c#

How to write Fibonacci Numbers Program in C# ?

  • The Fibonacci Numbers is a sequence of numbers in the following order: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34..
  • The next number is found by adding up the two numbers before it. The formula for calculating these numbers is:
  • F(n) = F(n-1) + F(n-2)

  • where:
  • F(n) is the term number.
  • F(n-1) is the previous term (n-1).
  • F(n-2) is the term before that (n-2).
  • By definition, the first two numbers in the Fibonacci Sequence are either 0 and 1, or 1 and 1, depending on the chosen starting point of the sequence and each subsequent number is the sum of the previous two numbers.
 C# Fibonacci Numbers

C# Fibonacci Numbers

Different ways to print Fibonacci Series in C#?

  • In C#, there are several ways to print Fibonacci Series.
  • Iterative Approach
  • Recursion Approach

Iterative Approach:

  • This is the simplest way of generating Fibonacci series in C#.
namespace ConsoleApplication
{
class Program
{
static int FibonacciSeries(int n)
{
int firstnumber = 0, secondnumber = 1, result = 0;

if (n == 0) return 0; //To return the first Fibonacci number   
if (n == 1) return 1; //To return the second Fibonacci number   

for (int i = 2; i <= n; i++)
{
result = firstnumber + secondnumber;
firstnumber = secondnumber;
secondnumber = result;
}
return result;
}
static void Main(string[] args)
{
Console.Write("Enter the length of the Fibonacci Series: ");
int length = Convert.ToInt32(Console.ReadLine());

for (int i = 0; i < length; i++)
{
Console.Write("{0} ", FibonacciSeries(i));
}
Console.ReadKey();
}
}  
}
click below button to copy the code. By - c# tutorial - team
 fibonacci iterative

Recursive Approach:

  • In this approach, we need to pass the length of the Fibonacci Series to the recursive method and then it iterates continuously until it reaches the goal.
namespace ConsoleApplication
{
class Program
{
public static int FibonacciSeries(int n)
{
if (n == 0) return 0; //To return the first Fibonacci number   
if (n == 1) return 1; //To return the second Fibonacci number   
return FibonacciSeries(n - 1) + FibonacciSeries(n - 2);
}
public static void Main(string[] args)
{
Console.Write("Enter the length of the Fibonacci Series: ");
int length = Convert.ToInt32(Console.ReadLine());
for (int i = 0; i < length; i++)
{
Console.Write("{0} ", FibonacciSeries(i));
}
Console.ReadKey();
}
}
}

click below button to copy the code. By - c# tutorial - team
 fibonacci recursive



Related Searches to Fibonacci C#