#### Java / Programs

# Write a Java program to calculate Fibonacci of N using memoize recursive method.

public class Fibonacci { static int n; private int[] memoise_array = new int[n]; public static void main(String[] args) { n = 6; System.out.println(new Fibonacci().fibonacci(n)); } int fibonacci(int n) { if (memoise_array[n - 1] != 0) return memoise_array[n - 1]; else if (n == 1 || n == 2) return 1; else memoise_array[n - 1] = fibonacci(n - 1) + fibonacci(n - 2); return memoise_array[n - 1]; } }

More Related questions...