Help the world stop coronavirus! Stay home!

Prev Next

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];
	}

}

❤Cash Back At Stores you Love !!!❤

Earn your $10 reward when you make your first purchase through Ebates by signing up with clicking below button.

Ebates Coupons and Cash Back

More Related questions...

Show more question and Answers...

JVM

Comments & Discussions