Boyer Moore majority vote Algorithm in c++

[rutujadhanawade]

Have you read the Contributing Guidelines on Pull Requests?

yes

Description

Boyer Moore Algorithm in c++

Checklist

• I've read the contribution guidelines.
• I've checked the issue list before deciding what to submit.
• I've edited the README.md and link to my code.

Related Issues or Pull Requests

#1439

[rutujadhanawade]

@iamrajiv Please review this

[atarax665]

This is not Boyer–Moore majority vote algorithm, this is the general algorithm to find majority element in an array. Please do check your algorithm once.

[iamrajiv]

@rutujadhanawade In Boyer–Moore majority vote algorithm the time complexity is linear but according to your code it is of quadratic time.

[rutujadhanawade]

I took referance from the code present in java folder https://github.com/TesseractCoding/NeoAlgo/blob/master/Java/Algorithms/Moore_Algorithm.java complexity of this algorithm is also not linear.

Now I have made all the changes in my code. Please review.

[atarax665]

I took referance from the code present in java folder https://github.com/TesseractCoding/NeoAlgo/blob/master/Java/Algorithms/Moore_Algorithm.java complexity of this algorithm is also not linear.

Now I have made all the changes in my code. Please review.

Thank you to let us know about this error.

[vatsalkesarwani12]

👍🏻

[rutujadhanawade]

Thank you to let us know about this error.

I would like to solve this error , Can I create a new issue for this?