Java Program for Fibonacci numbers

1. Use recursion Programming

class Fibonacci 
{ 
    static int fib(int n) 
    { 
    if (n <= 1) 
       return n; 
    return fib(n-1) + fib(n-2); 
    } 
} 

2. Use memory search

class Fibonacci 
{ 
    static int fib(int n){

        int[] f = new int[n + 1];
        Arrays.fill(f, -1);
        return fib(n, f);
    }

    private int fib(int n, int[] f){

        if(n == 0)
            return 0;
        if(n == 1)
            return 1;

        if(f[n] == -1)
            f[n] = fib(n - 1, f) + fib(n - 2, f);

        return f[n];
    }
} 

3. Use Dynamic Programming

class Fibonacci 
{ 
   static int fib(int n) 
    { 
    /* Declare an array to store Fibonacci numbers. */
    int f[] = new int[n+1]; // 1 extra to handle case, n = 0 
    int i; 
       
    /* 0th and 1st number of the series are 0 and 1*/
    f[0] = 0; 
    f[1] = 1; 
      
    for (i = 2; i <= n; i++) 
    { 
       /* Add the previous 2 numbers in the series 
         and store it */
        f[i] = f[i-1] + f[i-2]; 
    }     
    return f[n]; 
    } 
} 

4. Space Optimized Dynamic Programming

class Fibonacci 
{ 
    static int fib(int n) 
    { 
        int a = 0, b = 1, c; 
        if (n == 0) 
            return a; 
        for (int i = 2; i <= n; i++) 
        { 
            c = a + b; 
            a = b; 
            b = c; 
        } 
        return b; 
    } 
}