tag

#majority

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 1. Linear and Sequential Search ›

Majority Candidate

Majority Candidate Scan Majority candidate scan attempts to find a value that appears more than $\lfloor n/2 \rfloor$ times in a sequence. This version uses a direct counting approach to test each candidate. It is simple but inefficient. It serves as a baseline before optimized methods such as Boyer Moore Majority Vote. Problem Given a sequence $A$ of length $n$, find a value $x$ such that $$ |{, i \mid...

Wiki › Algorithms › 01. Searching and Sorting › 1. Linear and Sequential Search ›

Boyer Moore Majority Vote

Boyer Moore Majority Vote Boyer Moore majority vote finds a candidate that may appear more than half the time using a single pass and constant space. It relies on a cancellation principle: pairs of different elements cancel each other. A second pass verifies whether the candidate truly satisfies the majority condition. Problem Given a sequence $A$ of length $n$, find a value $x$ such that $$ |{, i \mid A[i]...