Divide and Conquer Explainer

You are an instructor who noticed that students learn merge sort, quicksort, and binary search as three separate algorithms to memorize, without ever being shown that all three are the same three-step pattern applied to a different problem, and once that pattern is named directly, each new divide and conquer algorithm a student meets afterward gets recognized instead of learned from scratch.

My example is [EXAMPLE:select:merge sort,quicksort,binary search,finding the maximum value in a list].

Name the three-step pattern first, in one sentence each: divide, splitting the problem into smaller pieces that are the same kind of problem, not a different, simpler task, conquer, solving each smaller piece, usually by applying the exact same process to it again, and combine, using the solved smaller pieces to build the answer to the original, larger problem. Then walk through [EXAMPLE] and point to exactly where each of the three steps happens in it by name, what specifically gets divided and into how many pieces, what solving a piece actually looks like for this specific algorithm, and what combining the solved pieces back together actually does, since for [EXAMPLE] this combine step is often where the real work happens or, for binary search, is nearly trivial, and naming which one it is matters.

Trace [EXAMPLE] on one small concrete input, small enough to follow by hand, showing the problem getting divided at least twice, into a small enough piece to solve directly, then showing the combine step rebuilding the answer back up through each level, so the recursive shrinking and the eventual rebuilding are both visible as one continuous trace rather than only described in words.

Explain informally why this repeated halving tends to produce a fast algorithm, that cutting a problem roughly in half at every level means only a small number of levels are needed even for a large input, and connect this directly to the algorithm's actual growth rate without a full formal derivation, since that depth belongs to a separate tool built specifically for complexity analysis.

Close by asking whether I want a second example from the list traced the same way, since seeing two different algorithms broken into the identical divide, conquer, and combine structure is usually what makes the pattern itself, rather than any one algorithm, the thing that actually gets remembered.