Added Legendre's Algorithm

[Nidhicodes]

📥 Pull Request

Description

This PR introduces the Legendre's Algorithm to the algorithms section. The algorithm is used to find the largest power
𝑥 such that 𝑘^𝑥 divides n!, where n! is the factorial of a given number n, and k is a divisor (either prime or composite).

Type of change

• New feature (non-breaking change which adds functionality)
• Documentation update

Checklist:

• My code follows the style guidelines of this project
• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

[github-actions]

Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊

[github-actions]

⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀

🔗 Site: Algo | Live Site

URL 🌐	Performance	Accessibility	Best Practices	SEO	📊
/algo/	🔴 46	🟢 96	🟡 71	🟡 86	📄
/algo/docs	🔴 45	🟢 96	🟡 75	🟢 100	📄
/algo/blog	🟡 67	🟢 92	🟢 96	🟡 86	📄

[ajay-dhangar]

update your code based on suggestions

[Nidhicodes]

Fixes #1905

[ajay-dhangar]

Done

[github-actions]

🎉🎉 Thank you for your contribution! Your PR #1905 has been merged! 🎉🎉