Java Coding Problems

Computing Fibonacci via RecursiveAction

Commonly denoted as F_n, the Fibonacci numbers are a sequence that respects the following formula:

F₀=0, F₁ = 1, ... F_n = F_n-1 + F_n-2 (n > 1)

A snapshot of Fibonacci numbers is:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...

The implementation of Fibonacci numbers via RecursiveAction can be accomplished as follows:

public class FibonacciRecursiveAction extends RecursiveAction {  private static final Logger logger =    Logger.getLogger(FibonacciRecursiveAction.class.getName());  private static final long THRESHOLD = 5;  private long nr;  public FibonacciRecursiveAction(long nr) {    this.nr = nr;  }  @Override  protected void compute() {    final long n = nr;    if (n <= THRESHOLD) {      nr = fibonacci(n);    } else { nr = ...