Input
Output
import java.util.Scanner; public class FibonacciRecursive { // Recursive method to return the nth Fibonacci number public static int fibonacci(int n) { if (n == 0) return 0; else if (n == 1) return 1; else return fibonacci(n - 1) + fibonacci(n - 2); } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); // Ask user for the number of terms System.out.print("Enter the number of terms: "); int n = scanner.nextInt(); System.out.println("Fibonacci Series using recursion:"); for (int i = 0; i < n; i++) { System.out.print(fibonacci(i) + " "); } scanner.close(); } }