Explore >> Select a destination
|
You are here 
|
johnazariah.github.io | ||
| | | | |
dusty.phillips.codes
|
|
| | | | | Introduction This is the second in a series of articles exploring the Gleam programming language. The first article explored some of the most basic features of Gleam; just enough to say hello. Hello is basically the first thing we learn in any language (whether human or programming). This article explores looping in Gleam. More specifically, it explores the fact that Gleam doesnt have any looping constructs. Thats right: none. Patreon If you find my content valuable, please do consider sponsoring me on P... | |
| | | | |
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). | |
| | | | |
jao.io
|
|
| | | [AI summary] The author explores the Y combinator and fixed-point combinators in lambda calculus, demonstrating how to implement recursive functions like list-length in Scheme using beta abstraction to manage a strict evaluation strategy. | ||
