Boyer–Moore majority vote algorithm
= Boyer–Moore majority vote algorithm
{wiki=Boyer–Moore_majority_vote_algorithm}
The Boyer–Moore majority vote algorithm is an efficient algorithm used to identify the majority element in a list or array. An element is considered a majority if it appears more than half the times (i.e., \\( \\frac\{n\}\{2\} \\) times, where \\( n \\) is the total number of elements) in the array.