CJCoding With Joseph
← Back to Question List
C# Code Walkthrough #21

Recursive Fibonacci

hardRecursion

📄 Code

Read carefully — what does this print?
1int Fib(int n) => n < 2 ? n : Fib(n - 1) + Fib(n - 2);
2Console.WriteLine(Fib(7));

🎯 Your Answer