Deployed math
summary
Claims that recursion is a direct application of mathematical induction and demonstrates it by implementing a factorial function that terminates at the base case, a recursive routine that generates string permutations using substring and charAt, and an array flattener for nested arrays and folder-path trees. Notes tradeoffs: recursion is pure but costs time and memory, sometimes simpler than iterative approaches, and sometimes redundant when language methods like flat exist; all examples run to completion in the demos.
AI-written summary · about
chapters (10)
- 0:00Math in web dev
- 0:46What recursion is
- 1:51Induction and recursion
- 2:57Factorial example
- 4:22String combinations
- 5:49Advantages and disadvantages of recursion
- 6:56When recursion helps
- 7:57Math for programming?
- 9:00Efficient problem solving
- 10:23Resources and closing
related talks
01h 04mRecursion has never been invented: A tale of intrigue
36mRecursion, Iteration & JavaScript: A love story
38mRecursion, Iteration, and JavaScript A Love Story
11mTail Call Optimization: The Musical!!
39mFun with Functional JavaScript
58mFun With Parsing
53mExplaining Lambda Calculus through Plain JavaScript
47mThere is a bluebird in my talk that wants to get out