#tail-call-optimization
Read more stories on Hashnode
Articles with this tag
堆栈溢出 递归函数(Recursive Function)如果调用自身次数过多,超过栈大小限制,就会导致栈溢出。 一个典型的例子是,用递归函数简陋实现斐波那契数列,如果调用参数过大,将导致栈溢出: function fibonacci(n) { if (n < 2) return 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...