"Algorithms" is Not a Four-Letter Word
summary
Forty-five minute survey implements and animates 11 maze algorithms and compares their actual properties: Aldous–Broder and Wilson produce a uniform spanning tree but can be extremely slow and theoretically unbounded, binary tree runs in linear time but shows strong directional bias, hunt‑and‑kill guarantees completion at roughly O(n^2) due to repeated scans, recursive division creates bottlenecks, Kruskal/Prim give weighted‑tree variants (Kruskal easily makes weaves), and the growing‑tree family morphs into others by changing selection.
AI-written summary · about
chapters (11)
- 0:00The value of hard work
- 2:53Introduction to algorithms
- 5:48Graph theory basics
- 8:24Early maze algorithms
- 13:19Advanced row-wise methods
- 16:24Hunt and kill methods
- 19:55Recursive division
- 22:36Kruskal's and Prim's
- 25:10Growing tree algorithm
- 30:37Customizing algorithms
- 34:24The importance of practice
related talks
29mSpotting Trees with Few Leaves
29mColor Coding-Related Techniques
19mLook Ma, I Know My Algorithms!
52mOn Algorithmic Game Theory I
01h 01mExact Algorithms from FPT Algorithms
01h 10mOn Algorithmic Game Theory II
01h 06mThe Square Root Phenomenon in Planar Graphs -- Survey and New Results
26mPrincipled algorithm, data structure and system design for Processing-in-Memory (PIM)”