Module
Classic Divide-and-Conquer Applications
Sign in to add this module to your path and practice.
About
Mergesort and inversion counting, closest pair of points, Karatsuba/Toom–Cook-style multiplication, and linear-time selection (quickselect / median-of-medians overview).
Goal
Derive the recurrences and O-bounds for the classic algorithms; implement the high-level structure in pseudocode; and adapt the paradigm to a novel geometric or combinatorial problem of similar flavor.
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Classic Divide-and-Conquer Applications. Ask about the concepts, goal, or where you're stuck.