Boyer Moore
In plain terms
A fast string-search algorithm that skips ahead intelligently.
Going deeper
Boyer-Moore searches for a pattern by comparing from the right and using mismatch rules to jump forward, often skipping many characters. It's very fast in practice.
Under the hood
Sub-linear average time via bad-character and good-suffix heuristics; also names a majority-vote algorithm.
Examples
Text editors' find, grep, intrusion detection, the majority-vote variant.
Think of it like...
Like scanning a page for a word but leaping ahead whenever a letter clearly rules out the current spot.