Backward In-Place Merge: When to Use It

Start with the idea

A problem is a good match for Backward In-Place Merge when it asks for merging sorted buffers with trailing capacity. Here the concrete task is: Merge the second sorted list into the first buffer. The visible input a=[1,3,7,0,0,0] m=3; b=[2,5,6] is an example, not a definition of the whole problem. Ask what operations the solution must support and what the input guarantees. Check whether the input is sorted, whether you may reorder it, and whether moving a pointer preserves the answer you seek. The right choice follows from those guarantees, not from a familiar noun in the prompt.

The decisive invariant is: Fill free capacity from the end so unread source values are never overwritten. Try to say why it applies to the task without quoting the implementation. Which fact becomes known after one update, and which possible answers remain? Two positions move according to a monotone fact: after one comparison, some candidates can be ruled out permanently. Name that fact. If that claim cannot be maintained on a legal input, the pattern is wrong or one of its preconditions is missing. A counterexample is more useful than a vague warning: change one property of the sample, trace the first two steps, and identify the exact claim that fails.

Compare costs before committing. The advertised bound is O(n+m) time · O(1) space; identify the operation responsible for it and the extra memory it needs.