Exercise 3: What Job the "Combine" Step Does That Brute Force Has No Equivalent Of — Possible Solution
====================================================================

WHAT MergeSort's COMBINE STEP ACTUALLY DOES
------------------------------
The Merge function takes two inputs that are each ALREADY CORRECTLY
SOLVED for their own smaller portion of the problem (two already-sorted
lists) and produces a correct answer for the larger, original problem
by interleaving them in the right order - comparing the front of each
list and taking the smaller each time. This step is doing genuine
logical work: it relies on a specific guarantee (that both inputs are
already sorted) to correctly produce a new, larger sorted list without
ever needing to re-examine or re-compare elements that were already
correctly ordered relative to each other within their own half.

WHY TwoSumBruteForce HAS NOTHING LIKE THIS
------------------------------
Chapter 6's TwoSumBruteForce doesn't solve any smaller sub-problems and
then combine their results at all - it directly checks every pair of
elements in the original list, one at a time, using nothing but the
original raw input. There is no step anywhere in brute force that takes
two already-solved pieces and merges them into a bigger correct answer,
because brute force never breaks the problem down into smaller pieces
in the first place - it works on the whole problem directly and
exhaustively, from start to finish, with no divide step and therefore
no combine step either.

WHY THIS IS THE STRUCTURAL DIFFERENCE, NOT JUST A DIFFERENT IMPLEMENTATION
------------------------------
This is exactly what this chapter's own explanation identified as the
real distinction: divide and conquer's combine step is only meaningful
because there was a prior divide step that produced genuinely separate,
independently-solvable sub-problems. Brute force has no divide step,
so it structurally cannot have a combine step either - it isn't that
brute force's combine step is simpler or missing some optimization, it's
that the entire "solve smaller pieces, then merge them" shape doesn't
exist in a brute-force algorithm at all.

WHY THIS WORKS AS AN ANSWER
------------------------------
The explanation describes precisely what logical work Merge performs
(interleaving two already-correct results using a guarantee about their
own internal order) and explains why TwoSumBruteForce has no equivalent
step by tracing the absence back to its own lack of any divide step in
the first place, rather than simply asserting the two algorithms are
"different."