Search for a command to run...
Articles tagged with #tail-call-optimization
堆栈溢出 递归函数（Recursive Function）如果调用自身次数过多，超过栈大小限制，就会导致栈溢出。 一个典型的例子是，用递归函数简陋实现斐波那契数列，如果调用参数过大，将导致栈溢出： function fibonacci(n) { if (n < 2) return n; return fibonacci(n - 1) + fibonacci(n - 2); } for (let n = 0; n < 100; n++) { console.log(`fibo ${n...
Stack Overflow Recursive functions can cause a stack overflow if they call themselves too many times and exceed the stack size limit. A classic example of a recursive function that can exceed the stack size limit if called with a large input is the n...