Stack overflow with Fibonacci's recursive call
问题 How exactly is the Java stack set up? For university, I shall determine what the biggest possible Fibonacci number that is calculated by a recursive method and can be handled by the stack. The interesting thing is: Tests showed that it doesn't matter how much -Xmx and -Xms the JVM has. I am able to run up to Fib(4438). But the results aren't consistent. Somtimes it goes down to 4436. Is there formular for the stack? Any increase of the stack via -Xss 4096m doesn't make a difference. 回答1: -Xmx