You need to implement a C# program that finds the nth Fibonacci number using recursion, where n is an input value. The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.
You need to implement a C#
The program should have a function named Fibonacci(int n) that takes an integer as an argument and returns an integer representing the nth Fibonacci number.
Constraints:
The input integer will be within the range of 0 <= n <= 45
The function should have a time complexity of O(2^n)
You can test the program using the following test cases:
Console.WriteLine(Fibonacci(0)); // 0
Console.WriteLine(Fibonacci(1)); // 1
Console.WriteLine(Fibonacci(2)); // 1
Console.WriteLine(Fibonacci(3)); // 2
Console.WriteLine(Fibonacci(4)); // 3
Step by step
Solved in 3 steps with 1 images
