Implemented moore voting algorithm

[SuprHUlk]

Description of Change

This pull request implements the Moore Voting Algorithm, addressing the issue #2830. Moore Voting Algorithm is used to find the majority element in an array (the element that appears more than ( \frac{n}{2} ) times). The algorithm works efficiently in O(n) time complexity and O(1) space complexity. The implementation includes:

• The algorithm in C++
• Self-contained tests verifying the correctness of the implementation
• Documentation following Doxygen guidelines, explaining each function and its usage

---

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, tests must pass
• [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Searched previous suggestions to confirm this implementation is not a duplicate
• [x] I acknowledge that all my contributions will be made under the project's license.

---

Notes:
This implementation follows the proposed solution in the issue #2830. It includes detailed documentation to explain the algorithm’s logic, making it educational for developers and contributors.

[github-actions[bot]]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.