public int fibonacciSeriesRecursive(int n){
        if(n == 1 || n == 0){
            return n;
        }
        return fibonacciSeriesRecursive(n-1) + fibonacciSeriesRecursive(n-2);
    }
Recursive and slow version. Recalculates same value over and over again.
Chokes for n greater than 60
src/com/interview/dynamic/FibonacciSeries.java