Group
Functions in C#
Objective
1. Define a recursive function called "Fibonacci" that takes an integer parameter representing the position in the Fibonacci sequence.
2. The base case of the recursion will be when the position is 1 or 2, in which case it should return 1.
3. For all other positions, return the sum of the results of calling Fibonacci for the two preceding positions.
4. In the Main method, test the Fibonacci function by passing an integer value and displaying the result.
Write a C# program that uses recursion to calculate a number in the Fibonacci series (in which the first two items are 1, and for the other elements, each one is the sum of the preceding two).
public static void Main()
{
// Print the Fibonacci number at position 6 using recursion
Console.WriteLine(Fibonacci(6)); // This will print "8"
}
Example C# Exercise
Show C# Code
using System;
class Program
{
// Main method where the program execution begins
public static void Main()
{
// Print the Fibonacci number at position 6 using recursion
Console.WriteLine(Fibonacci(6)); // This will print "8"
}
// Recursive function to calculate the Fibonacci number at a given position
public static int Fibonacci(int n)
{
// Base case: if n is 1 or 2, return 1
if (n == 1 || n == 2)
{
return 1; // Base case: Fibonacci(1) and Fibonacci(2) are both 1
}
// Recursive case: return the sum of the two preceding Fibonacci numbers
return Fibonacci(n - 1) + Fibonacci(n - 2); // Recursive call to calculate the Fibonacci number
}
}
Output
8