Tag
recursion
- May 11, 2026 Space Complexity Accounting for Recursion, Auxiliary Buffers and Output Stack depth, explicit work arrays and output storage are three separate memory costs, and the convention for counting them decides whether an algorithm is called O(1) space, O(log n) or O(n). algorithms
- Apr 18, 2026 Iterative Depth-First Search Without Losing Finish Times Why a stack of vertices does not reproduce recursive DFS, how to keep an explicit frame with a resume index, and what changes when the traversal can be paused and resumed. algorithms
- Mar 30, 2025 Fixed-Point Combinators and How Recursion Enters a Nameless Calculus Why a finite lambda term cannot refer to itself, how the Y and Turing combinators manufacture self-reference through duplication, and what the Z variant fixes about call-by-value. computation theory
- Jan 21, 2025 Iterative Resolution: Walking the Tree from Root Hints to Answer The referral chain a recursive resolver follows, how the cache shortens it, why the answer arrives as an RA response rather than a chain, and where the walk can stall. internet protocols
- Oct 20, 2024 Memoization Mechanics: Cache Keys, Laziness, and Recursion Depth How top-down memoization turns a recursion tree into a DAG, what the cache key must contain to be sound, and why the lazy traversal sometimes loses to a full table. algorithms