Subato

Fibonacci Baumrekursiv

class Fib{
  static int fib(int n) {
    assert n >= 0;
    if (n <=1) return n;
    return fib(n-2) + fib(n-1);
  }
}