Solution (source code)

= Solution

\b[Yes], if a merge takes from its left half when two <sort keys> compare equal. Within each half the <induction hypothesis> preserves equal-key order. Across the two halves every left-half occurrence originally preceded every right-half occurrence, and the tie rule preserves that order. Reversing the tie rule would lose <stable sorting>.