Generate Fibonacci sequence using dynamic programming approach
public class FibonacciGenerator {
/**
* Generates Fibonacci sequence up to n terms using dynamic programming
* @param n Number of terms to generate
* @return Array containing Fibonacci sequence
*/
public static long[] generateFibonacci(int n) {
if (n <= 0) return new long[0];
if (n == 1) return new long[]{0};
if (n == 2) return new long[]{0, 1};
long[] fib = new long[n];
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i < n; i++) {
fib[i] = fib[i-1] + fib[i-2];
}
return fib;
}
public static void main(String[] args) {
long[] sequence = generateFibonacci(20);
System.out.println("First 20 Fibonacci numbers:");
for (int i = 0; i < sequence.length; i++) {
System.out.print(sequence[i] + " ");
}
}
}
Views
Lines
Characters
Likes