Faboncahi_recursive.java

public class HelloWorld{

     public static void main(String []args){
       int arr[] = new int[13];
       
       fab(13, arr);
       
       
     }
     
     static int fab(int n, int arr[]){
       if (n == 1 || n == 2 && arr[n - 1] == 0){
         arr[n - 1] = 1;
         System.out.println(1);
         return 1;
       }
       
       if (arr[n - 1] != 0 ){
          return arr[n - 1];   
       }else{
          arr[n - 1] = fab(n - 2, arr) + fab(n - 1, arr);
          System.out.println(arr[n - 1]);
          return arr[n - 1];
       }
     }
     
     
}