Tail Recursion Fibonacci Sequence

Tail Recursion Fibonacci Sequence

public class TailRecursion {
	//implement fibonacci function
	public static void main(String[] args) {
		TailRecursion t = new TailRecursion();
		int normal = t.nFibo(9);
		System.out.println(normal);
		int tail = t.tailFibo(9);
		System.out.println(tail);
	}
	//normal calculation
	public int nFibo(final int n){
		if(n <= 2)
			return 1;
		return nFibo(n-1) + nFibo(n-2);
	}
        //tail recursion version
	public int tailFibo(int n){
		return tailAux(n,3,1,1);
	}
	public int tailAux(int n, int i, int seclast, int last){
		if(i >= n)
			return last+seclast;
		
		return tailAux(n, i+1, last, seclast + last);
	}
	//1,1,2,3
	//2,2
}