Fibonacci Memory Recursion

Although the teaching material says that the Fibonacci sequence is inefficient in terms of recursion, the number of repetitions is too many, but if the results are saved, using the memory idea, you can use recursion to calculate the Fibonacci

The code is as follows

public class Fibonacci memory recursive {static int n=150;static int[] mem=new int[n+1];p ublic static void Main (string[] args) {//Initialize first and second me M[1]=1;mem[2]=1; System.out.println (Feibo (n));} public static int Feibo (int n) {if (mem[n]>0) return Mem[n];mem[n]=feibo (n-1) +feibo (n-2); return mem[n];}}

Fibonacci Memory Recursion