java递归优化,java支持并优化尾递归调用吗？

Say I got a recursive function that is tail-recursive.

System.out.println( sum(Arrays.asList(0, 1, 2, 3, 4, 5)) );

int sum(List integers) {

if (integers.isEmpty())

return 0;

else

return integers.get(0) + sum(integers.subList(1, integers.size()));

}

I wonder if this function sum will grow on stack or will it be changed to a loop (since it is a tail-recursive function)?

I have just read that Scala detects such calls and optimizes it but is this a Scala-only thing or JVM in general?

解决方案

Java supports tail-recursive calls, but AFAIK it doesn't optimize them away. I think it's the Scala compiler that is simply capable of this, not the JVM itself. Check out the @tailrec annotation in Scala to see what more the compiler is capable of :)

But regardless of whether Java/JVM optimizes tail-recursion away, your function would be harder to optimize than necessary.

Look at this:

int sum(List integers) {

return sum(integers, 0);

}

int sum(List integers, int sumSoFar) {

if (integers.isEmpty())

return sumSoFar;

else

return sum(

integers.subList(1, integers.size()),

sumSoFar + integers.get(0)

);

}

See, I've added an overloaded sum with a so-far calculated sum parameter. This way when you recur in the else branch you don't need the actual stack frame any more - you got all you need as function arguments in the recursive call.

In your snippet the stack frame would probably have to exist as long as the recursive call..