//  Data Structures with Java by John R. Hubbard
//  Copyright McGraw-Hill, 2001
//  Example 4.6 on page 74
//  Recursive Implementation of Fibonacci Function


public class Ex0406
{ public static int fib(int n)
  { if (n < 2) return n;  // basis
    return fib(n-1) + fib(n-2);     // recursive part
  }

  public static void main(String[] args)
  { for (int n=0; n<16; n++)
      System.out.println("fib("+n+") = "+fib(n));
  }
}