Work-in-progress overview for a visual guide to the Master theorem for divide-and-conquer recurrences: when it applies, how to read the a, b, and f notation, and canonical examples (merge sort, tree traversals, Karatsuba-style recurrences). Expanded walkthroughs tie to analysis of algorithms coursework and the Master theorem blog post.