/**
 * Basic Fibonacci program.
 * @author Steven R. Brandt
 * 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
 **/
public class Fib3 {
    public static void fib(long[] vals,int n) {
        if(n < 2) return;
        long v1 = vals[1];
        long v2 = vals[0]+v1;
        vals[0] = v1;
        vals[1] = v2;
        fib(vals, n-1);
        return;
    }
    public static long fib(int n) {
        // Exit condition
        if(n < 2)
            return n;

        // Recursion
        long[] vals = new long[]{1,1};
        fib(vals,n);
        return vals[1];
    }
    public static void main(String[] args) {
        // We won't make it to 1000
        for(int i=-1;i<100;i++) {
            System.out.println("i="+i+", "+fib(i));
        }
    }
}