-
-
Notifications
You must be signed in to change notification settings - Fork 5.7k
Moore's Voting Algorithm - Boyer-Moore Majority Voting Algorithm #1750
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
mrinalchauhan
wants to merge
5
commits into
TheAlgorithms:master
Choose a base branch
from
mrinalchauhan:master
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
5 commits
Select commit
Hold shift + click to select a range
a7928f5
feat : added find majority element in array using Moore's Voting Algo…
8d44461
feat : added find majority element in array using Moore's Voting Algo…
448415c
feat: added find majority element in array using Moore's Voting Algor…
193763d
fix: updated CONTRIBUTING.md and added test cases for Moore Voting Al…
1951f32
fix: updated code
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
Empty file.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,29 @@ | ||
/** | ||
* Moore Voting Algorithm to find the majority element in an array | ||
* Majority element is the one that appears more than n/2 times | ||
* geeksforgeeks: https://www.geeksforgeeks.org/boyer-moore-majority-voting-algorithm/ | ||
* @param {Array} arr array of integers | ||
* @returns {Number} majority element or null if no majority exists | ||
*/ | ||
const MooreVotingAlgorithm = (arr) => { | ||
let candidate = null | ||
let count = 0 | ||
|
||
// Phase 1: Find the candidate for majority element | ||
for (let num of arr) { | ||
if (count === 0) { | ||
candidate = num | ||
} | ||
count += num === candidate ? 1 : -1 | ||
} | ||
|
||
// Phase 2: Verify if the candidate is actually the majority element | ||
count = 0 | ||
for (let num of arr) { | ||
if (num === candidate) { | ||
count++ | ||
} | ||
} | ||
return count > arr.length / 2 ? candidate : null | ||
} | ||
export { MooreVotingAlgorithm } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,11 @@ | ||
import { MooreVotingAlgorithm } from '../MooreVotingAlgorithm' | ||
describe('Moore Voting Algorithm', () => { | ||
it.each([ | ||
[[1, 1, 2, 1, 3, 1, 1], 1], // Majority element 1 | ||
[[2, 2, 2, 2, 5, 5, 5, 2], 2], // Majority element 2 | ||
[[3], 3], // Single element, it's the majority | ||
[[1, 2, 3, 4, 5, 6, 7], null] // No majority element in the array | ||
])('returns %j when given %j', (array, expected) => { | ||
expect(MooreVotingAlgorithm(array)).toEqual(expected) | ||
}) | ||
}) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.