Java recursive Fibonacci sequence

Java recursive Fibonacci sequence

The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, usually starting with 0 and 1. In Java, you can compute the Fibonacci sequence recursively. Here's a Java program that calculates the Fibonacci sequence recursively:

public class FibonacciRecursive { public static void main(String[] args) { int n = 10; // Change 'n' to the desired Fibonacci number System.out.println("Fibonacci sequence up to " + n + " numbers:"); for (int i = 0; i < n; i++) { System.out.print(fibonacci(i) + " "); } } public static int fibonacci(int n) { if (n <= 1) { return n; } else { return fibonacci(n - 1) + fibonacci(n - 2); } } }

In this program:

  1. fibonacci(int n) is a recursive function that calculates the nth Fibonacci number. If n is 0 or 1, it returns n (base cases). Otherwise, it recursively calls itself with n - 1 and n - 2 and returns the sum of the results.

  2. In the main method, you can change the value of n to determine how many Fibonacci numbers you want to calculate and print.

When you run the program, it will print the Fibonacci sequence up to the specified number:

Fibonacci sequence up to 10 numbers: 0 1 1 2 3 5 8 13 21 34

Keep in mind that recursive Fibonacci calculation can become inefficient for large values of n due to repeated calculations of the same Fibonacci numbers. For better performance, consider using an iterative or memoization-based approach for large n values.

More Tags

apache-mina python-module fastapi android-progressbar taxonomy zipline same-origin-policy managed-bean file-format vue-props

More Java Questions

More Chemistry Calculators

More Biochemistry Calculators

More Weather Calculators

More General chemistry Calculators