An Introduction to Recursion
summary
Begins with conceptual definitions then walks through writing recursive Python functions for factorial and sum from 1 to n using pseudo‑code translated into real code, compares each to iterative for‑loops, and implements the classic Fibonacci interview problem showing the naive recursive runtime is O(2^n) and the iterative version is roughly O(n). Explains base cases, stack overhead, and that memoization fixes exponential blowup; ends with a coding problem from a real interview at a financial company.
AI-written summary · about
chapters (8)
- 0:00Introduction to recursion
- 1:47Conceptualizing recursion
- 8:04Implementing recursion in code
- 12:47Applying recursion to sums
- 17:02Recursion vs iteration
- 19:25Analyzing runtime complexity
- 24:27The Fibonacci challenge
- 29:54Interview analysis and Q&A
related talks
01h 39mA Beginner's Guide to Tackling Recursion
57mElements of Programming Interviews in Python
43mFunctional Programming in an Imperative World. Maybe
29mWriting Functional Code in Python
27mWhen to refactor your code into generators and how
02h 28mFunctional Python
19mPython - best practices
02mTutorial Sneak Peek: "Lazy Looping in Practice..."