Boyer–Moore Majority Vote: Mental Model

Start with the idea

Begin with the concrete question: Return the strict majority value; the input guarantees that one exists. For the visible input [2, 1, 2, 3, 2, 2, 4], the stated result is 2. Before reading code, name the smallest piece of information that must survive from one step to the next. A scan turns a sequence into a small piece of state. Say what the state means after the first i elements, before you describe a loop body. That is the mental model for Boyer–Moore Majority Vote; it gives you a reason for each update instead of a line of code to memorise.

The core mechanism is this: Cancel different values in pairs so a strict majority remains as the candidate. Treat it as a claim to test after every operation. Write down the state before the first operation, update it once, and ask which part of the claim is still true. If an item is skipped, inserted, or removed, explain why that action cannot destroy an answer that should be retained. A useful trace has columns for the current input position, the state before the step, the action, and the state afterward. Use the visible sample until the expected result becomes inevitable rather than merely plausible.

Now inspect the Rust sketch, not just its final expression. The supplied Rust sketch is a starting point.