Added Counting divisors in Number Theory

[T-Fathima]

📥 Pull Request

Description

The Counting Divisors algorithm has been implemented to compute the total number of divisors of a given integer n efficiently. This solution addresses the need for fast divisor counting, particularly useful in number theory problems such as perfect number checking and factorization. By iterating only up to the square root of n, the algorithm reduces time complexity from O(n) to O(√n), improving performance for large values of n.

Fixes #1964

Type of change

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• 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

@ajay-dhangar Could you please review and merge it with labels.
Thank you.

[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/	🟡 64	🟢 96	🟡 71	🟡 86	📄
/algo/docs	🔴 49	🟢 96	🟡 75	🟢 100	📄
/algo/blog	🟡 67	🟢 92	🟢 96	🟡 86	📄

[ajay-dhangar]

Done

[github-actions]

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