Module
Divide-and-Conquer Algorithms
Sign in to add this module to your path and practice.
About
Paradigm of splitting, conquering recursively, and combining. Recurrences, the Master Theorem, and canonical examples (mergesort, counting inversions, closest pair, integer/matrix multiplication, quickselect/median-finding).
Goal
Recognize D&C structure; set up and solve recurrences (Master Theorem + substitution/recursion trees); design and analyze new D&C algorithms; and prove correctness via induction on subproblem size.
Prerequisites
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Divide-and-Conquer Algorithms. Ask about the concepts, goal, or where you're stuck.