Method fib

benchmark/bench/recursive.java:33–37

(int n)

  }

  public static int fib(int n)
  {
    if (n < 2) return 1;
    return fib(n - 2) + fib(n - 1);
  }

  public static double fib(double n)
  {