soujava-threads-TailRecursion.java

package forkjoin;

public class FibonacciProblem2 {

	int n;

	public FibonacciProblem2(int n) {
		this.n = n;
	}
	
	public long solve() {	
		return fibonacci(n, 0L, 1L);
	}

	private long fibonacci(int n, long current, long next) {
		if (n == 0) 
			return current;
		else 
			return fibonacci(n-1, next, current + next); 
	}

	public int getN() {
		return n;
	}
}