--- title: "#tail-call-optimization articles | Hashnode" description: "Explore 5 articles tagged #tail-call-optimization on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/tail-call-optimization" --- Tag # #tail-call-optimization 5 posts · 0 followers [Maverick](https://hashnode.com/@maverick48) · [Jul 11, 2025](https://hashnode.com/posts/tail-call-optimization-tco/68714f3d4d267f4cf36e2faa) ### [Tail Call Optimization (TCO)](https://jyanshu.hashnode.dev/tail-call-optimization-tco?utm_source=hashnode&utm_medium=feed) Explore how Tail Call Optimization (TCO) enhances performance in recursive functions by using constant stack space and preventing overflow 6 min read · [jyanshu.hashnode.dev](https://jyanshu.hashnode.dev/tail-call-optimization-tco?utm_source=hashnode&utm_medium=feed) [v like](https://hashnode.com/@likev) · [Jan 22, 2024](https://hashnode.com/posts/recursive-functions-dont-casue-stack-overflow-in-js-cn/65ae33f78ce8d4c849cabf06) ### [Js 不导致栈溢出的递归函数](https://blog.iread.fun/recursive-functions-dont-casue-stack-overflow-in-js-cn?utm_source=hashnode&utm_medium=feed) 堆栈溢出 递归函数（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... 1 min read · [blog.iread.fun](https://blog.iread.fun/recursive-functions-dont-casue-stack-overflow-in-js-cn?utm_source=hashnode&utm_medium=feed) [v like](https://hashnode.com/@likev) · [Jan 22, 2024](https://hashnode.com/posts/recursive-functions-dont-casue-stack-overflow-in-js/65ae2dc3d94805e5634364c5) ### [Recursive functions don't casue stack overflow in JS](https://blog.iread.fun/recursive-functions-dont-casue-stack-overflow-in-js?utm_source=hashnode&utm_medium=feed) 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... 2 min read · [blog.iread.fun](https://blog.iread.fun/recursive-functions-dont-casue-stack-overflow-in-js?utm_source=hashnode&utm_medium=feed) [Erman İmer](https://hashnode.com/@ermanimer) · [Jul 27, 2023](https://hashnode.com/posts/tail-call-optimization-in-elixir/64c23f3104304a64b9351c9f) ### [Tail Call Optimization In Elixir](https://ermanimer.hashnode.dev/tail-call-optimization-in-elixir?utm_source=hashnode&utm_medium=feed) Learn how Elixir's tail call optimization enhances performance by reducing stack overhead in recursive function calls 2 min read · [ermanimer.hashnode.dev](https://ermanimer.hashnode.dev/tail-call-optimization-in-elixir?utm_source=hashnode&utm_medium=feed)