Skip to content

Create Boyer-Moore Majority Voting Algorithm (C++) #292

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.

Sign up for GitHub

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

bose-aritra2003 wants to merge 2 commits into codeIIEST:master

from bose-aritra2003:patch-1

Open

Create Boyer-Moore Majority Voting Algorithm (C++) #292

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

Create Boyer-Moore Majority Voting Algorithm

bose-aritra2003 Jul 2, 2022

Update majority-element.cpp

bose-aritra2003 Jul 2, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

41 changes: 41 additions & 0 deletions Competitive Coding/Search/majority-element.cpp

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,41 @@
	// C++ implementation of Boyer-Moore Majority Voting Algorithm
	#include <iostream>
	using namespace std;

	// Function to find majority element
	int findMajority(int arr[], int n)
	{
	int i, candidate = -1, votes = 0;
	// Finding majority candidate
	for (i = 0; i < n; i++) {
	if (votes == 0) {
	candidate = arr[i];
	votes = 1;
	}
	else {
	if (arr[i] == candidate)
	votes++;
	else
	votes--;
	}
	}
	int count = 0;
	// Checking if majority candidate occurs more than n/2
	// times
	for (i = 0; i < n; i++)
	if (arr[i] == candidate)
	count++;

	if (count > n / 2)
	return candidate;
	return -1;
	}

	int main()
	{
	int arr[] = { 1, 1, 1, 1, 2, 3, 4 };
	int n = sizeof(arr) / sizeof(arr[0]);
	int majority = findMajority(arr, n);
	cout << " The majority element is : " << majority;
	return 0;
	}