Tail Recursion

How do i make this function tail recursive in java


public int fib(int n)
{
  return( n <= 1 ? n : fib(n-1) + fib(n-2) );
}

A tail call is just returning another function.


return fn();

Some compilers will optimize it to run in constant space.


This is not doing it right as you are returning an operation on the function result.


return n * fn();

Have a look at this:
http://stackoverflow.com/questions/5453376/tail-call-optimization-for-fibonacci-function-in-java