Educational Cards
Learn from video content, text, and interactive tasks
Filters
Big-O: describe growth, not microseconds
Big-O notation answers: “If I double the training set / feature dimension / graph size, what...
Mutual recursion on complementary predicates
Mutual recursion means two (or more) functions call each other. The textbook example is even and...
Tree-shaped data and recursive visitation
Decision trees, aggregation hierarchies (region → store → SKU), and JSON documents all share...
Recursion depth and the call stack
Every recursive call consumes a stack frame in CPython: local variables, return address, and...
Divide-and-conquer search on sorted data
Binary search is the textbook logarithmic pattern: each comparison discards half of the remaining...
Fibonacci pitfalls: branching work
The one-liner fib(n) = fib(n-1) + fib(n-2) is a famous trap: it is correct as mathematics and...
Recursion mirrors problem structure
Many real datasets are not rectangular tables yet: responses from REST APIs mix dicts and lists;...
Base cases anchor recursive solutions
When you ingest nested JSON from a feature store, walk a directory of experiment artefacts, or...
Debugging recursive programs
Recursive bugs cluster into three buckets: no base case (infinite recursion), wrong combine step...
Convolution and polynomial multiplication: FFT roadmap
The final arc gives the deep structural payoff: convolving coefficient lists is equivalent to...
Kernels in action: smoothing and edge detection
The middle of the lecture generalizes the same overlap rule from short number lists to long signals...
Flip, slide, multiply, add: discrete convolution algorithm
This card formalizes the mechanical procedure used repeatedly in the lecture: reverse one list,...