Boyer–Moore Majority Vote

Easy

The Boyer–Moore Majority Vote algorithm finds the majority element (one appearing more than half the time) in a single pass (O(n)) using only constant memory (O(1)). It keeps just one candidate and its lead count.

📊 Complexity

Type	Value
Best	O(n)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

BasicsImplementationVoting AlgorithmO(n)

📖 Introduction

Boyer–Moore Majority Vote is an algorithm that, if a majority element (more than half) exists, finds it. The key is two variables — a candidate and a count — where each differing value cancels one of the candidate's votes.

1/18

🚀Start Boyer–Moore Majority Vote

We find the "majority element" (appearing more than half the time) in a single pass (O(n)) using just two variables (O(1)): a candidate and its lead count.

Boyer–Moore Majority Vote

Easy

Boyer–Moore Majority Vote

📊 Complexity

Type	Value
Best	O(n)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

BasicsImplementationVoting AlgorithmO(n)

📖 Introduction

1/18

🚀Start Boyer–Moore Majority Vote

We find the "majority element" (appearing more than half the time) in a single pass (O(n)) using just two variables (O(1)): a candidate and its lead count.

🚀Start Boyer–Moore Majority Vote