dynamic programming solution to fibonacci sequence

gistfile1.java

public class fib
{
    public static void main(String[] args)
    {
        System.out.println(fib(5));
    }
    
    public static int fib(int x)
    {
        // create an array of size x
        int[] dp = new int[x+1];
        
        // base case
        dp[0] = 0;
        dp[1] = 1;
        
        for (int i=2; i<=x; i++)
            
            // update based on the last two
            dp[i] = dp[i-1] + dp[i-2];
        
        return dp[x];
    }
}