Question Title
Java Programming Course
Course 1: Problem-Solving and Computational Thinking using Java
Sprint 7: Implementing Recursion
Problem Statement
Write a program in Java
to calculate the n
th term of the Fibonacci series recursively using the following formula:
Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2)
Task
- Open the source code file and complete the code.
- Open the test case file and run the test cases to check your code.