Tail recursion optimized javascript code performance worse than non optimization, it's counterintuitive，Is it because the compiler doesn't optimize? [duplicate]

Question

function factorialNormal(n) {
  if (n === 1) {
    return n
  }
  return n + factorialNormal(n - 1)
}

function factorialWithTail(n, acc) {
  if (n === 1) return acc;
  return factorialWithTail(n-1, n + acc)
}

recursion function is fast than tail-recursion and the tail use more memory, causing the maximum call stack

Matthieu Riegler · Accepted Answer · 2022-07-12 09:39:32Z

3

There is no TCO on V8 currently.

answered Jul 12, 2022 at 9:39

Matthieu Riegler

59.9k27 gold badges158 silver badges208 bronze badges

Sign up to request clarification or add additional context in comments.

1 Answer 1