Deployed Math

on YouTube ↗11m

" summary

Explores using recursion in JavaScript to express mathematical induction and combinatorics, with concrete code for factorial (e.g., 5! = 120) and string permutations implemented by removing one character until an empty-string base case. Compares practical tradeoffs — clearer pure functions but higher time/memory cost — and shows recursive examples for flattening nested arrays and folder-like route structures versus using Array.prototype.flat when available; links to worked examples and math primers are provided.

AI-written summary · about

" chapters (10)

1. 0:00Web dev math
2. 0:45What is recursion
3. 2:11Mathematical induction
4. 3:39Factorial example
5. 4:22String combinations
6. 5:48Recursion pros/cons
7. 6:51When to use recursion
8. 7:55Math for coding?
9. 9:00Simple vs complex code
10. 10:05Deep dive into math

" related talks

• 01h 04mRecursion has never been invented: A tale of intrigueLucas Fernandes Da Costa · HolyJS Piter 2019
• 36mRecursion, Iteration & JavaScript: A love storyAnjana Vakil · ngAtlanta 2019
• 38mRecursion, Iteration, and JavaScript A Love StoryAnjana Vakil · JSHeroes 2018
• 49mGoing Functional with JSHemanth HM · JSFoo 2015
• 39mFun with Functional JavaScriptKuba Waliński · Codemotion Rome 2015
• 01h 03mFunctional Programming in JavaScriptRouben Meschian · JS Conf Armenia 2017
• 17mHow Does JavaScript Math?Meara Charnetzki · EmpireJS 2018
• 48mIt’s birds all the way down: Fun Introduction to Lambda CalculusLucas Fernandes Da Costa · Armada JS 2019