Calculates arbitrary points in the fibonacci sequence using recursion. This is actually salesforce Apex code, not java.

apex_fib.java

# this is, obviously, just an apex exploration
# i.e. horribly inefficient
Integer fib(Integer n) {
  if (n <= 1) return 1; else return fib(n-1) + fib(n-2);
}

for (Integer i=0; i<=12; i++) {
  System.debug(fib(i));
}