/explore
|
You are here 
|
johnazariah.github.io | ||
| | | | |
blog.scottlogic.com
In this post we will see how Thunks and Trampolines can help solve problems by converting deep stack-based recursion into heap-based iteration helping to prevent StackOverflowErrors |
|
| | | | | ||
| | | | |
blog.moertel.com
[AI summary] A technical guide explains how to manually convert recursive Python functions into iterative ones using a simple method and the accumulator pattern to avoid stack overflow limits. |
|
| | | | | ||
| | | | |
abhinavomprakash.com
Defining recursion in terms of itself is an old joke among programmers. Despite the fact that it frustrates a lot of new-comers, we don't change it. I like to define recursion as "Iteration for the cool kids". I don't mean this in a snobbish, let-us-exclude-the-for-loopers kinda way, but rather in a tone of appreciation. Recursion is an elegant way of doing things. Recursive alogrithms are concise, have less noise and have immutability baked in (always a plus). |
|
| | | | | ||
| | | | |
dr-knz.net
This post follows up on OCaml for Haskellers from Edward Z. Yang (2010) and my own Haskell for OCaml programmers from earlier this year. Note The latest version of this document can be found online at https://dr-knz.net/rust-for-functional-programmers.html. Alternate formats: Source, PDF. Prologue Rust for C programmers ... |
|
| | | |||
