This prevents the engine from deleting the stack by forcing it to create a new one where the initial values are stored. In other words, tail call optimization means that it is possible to call a function from another function without growing the call stack. Is it possible that when we have a JVM implementation that supports tail-call optimization we could make the recursive version comparable to others?nI have read somewhere that the IBM JVM implementation supports tail-call optimization Maido Käära February 19, 2013 Before applying any optimization you have to understand if your code is running on a critical path. Defines a table caption
Tail recursion method takes advantage of tail call optimization when the code is run is strict mode. Tail-call optimization is a part of the ES2015-ES6 specification.