Skip to content
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

Moore's voting algorithm to find the majority element in an array #2016

Open
Pushpit07 opened this issue May 27, 2021 · 1 comment
Open

Moore's voting algorithm to find the majority element in an array #2016

Pushpit07 opened this issue May 27, 2021 · 1 comment

Comments

@Pushpit07
Copy link
Contributor

Is your feature request related to a problem? Please describe.
In an array A of N elements, find the majority element in the array. A majority element in an array A of size N is an element that appears more than N/2 times in the array.

Describe the solution you'd like
I would use Moore's voting algorithm to find the majority element in the array

Do you want to work on it
I want to work on this problem in C++

@Pushpit07
Copy link
Contributor Author

Please assign it to me under GSSoC

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant