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

Jump to bottom

Optimizing Boyer–Moore majority vote algorithm #1852

Closed

rutujadhanawade opened this issue Jan 1, 2021 · 1 comment · Fixed by #1875

Assignees

Labels

Java

Contributor

rutujadhanawade commented Jan 1, 2021

In code present in java folder https://github.com/TesseractCoding/NeoAlgo/blob/master/Java/Algorithms/Moore_Algorithm.java complexity of this algorithm is Quadratic.
but according to Boyer–Moore majority vote algorithm the time complexity should be linear.
I would like to fix this .

github-actions bot added the Java label

Contributor Author

rutujadhanawade commented Jan 1, 2021

@iamrajiv @atarax665 Please assign this to me.

iamrajiv assigned rutujadhanawade

rutujadhanawade mentioned this issue

The Boyer–Moore majority vote algorithm java #1875

Merged

3 tasks

iamrajiv closed this as completed in #1875

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment