티스토리 뷰
public static int fib( int f0, int f1, int n ) { if ( n == 0 ) return f0; else if ( n == 1 ) return f1; else return fib( f0, f1, n - 1 ) + fib( f0, f1, n - 2 ); }
public static int fib( int f0, int f1, int n ) { if ( n == 0 ) return f0; else if ( n == 1 ) return f1; else return fib( f0, f1, n - 1 ) + fib( f0, f1, n - 2 ); }