INPUT:Element Number (N)
OUTPUT: SUM OF ELEMENT OF THE FIBONACCI SERIES
Data Structure: Recursive Stack and HashMapÂ
STEP 1: START
STEP 2: FIBO(N)
STEP 3: IF(N<=1)
STEP 4: RETURN N
STEP 5: RETURN FIBO(N-1)+FIBO(N-2)
STEP 5: STOPCode
import java.util.*;
class dp{
static HashMap<Integer,Integer> ob=new HashMap<>();
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
System.out.println("ENTER THE NUMBER");
int n=sc.nextInt();
System.out.println(fibo(n));
}
public static int fibo(int n){
if(ob.containsKey(n)){
return ob.get(n);
}
if(n<=1)
return n;
int res=fibo(n-1)+fibo(n-2);
ob.put(n,res);
return res;
}
}Output
user@computer$ ENTER THE NUMBER
9
34
