feat: add Sieve of Eratosthenes algorithm

[Navadeep0007]

Description

Implements the Sieve of Eratosthenes algorithm for efficiently finding all prime numbers up to a given limit.

Issue

Closes #6939

Changes Made

• ✅ Added SieveOfEratosthenes.java with complete implementation
• ✅ Added SieveOfEratosthenesTest.java with comprehensive test cases
• ✅ Includes JavaDoc documentation with complexity analysis
• ✅ Handles edge cases (negative input, 0, 1, 2)
• ✅ All tests passing

Algorithm Details

• Time Complexity: O(n log log n)
• Space Complexity: O(n)
• Efficiently marks composite numbers using multiples

Testing

• Tested with small numbers (0, 1, 2, 10, 30)
• Tested with larger numbers (100, 1000)
• Edge case testing (negative input)
• All test cases passing ✅

Checklist

• Code follows project style guidelines
• Added unit tests
• All tests pass
• Added JavaDoc comments
• No breaking changes

[codecov-commenter]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 78.35%. Comparing base (9381161) to head (e8df56a).

Additional details and impacted files

@@            Coverage Diff            @@
##             master    #7071   +/-   ##
=========================================
  Coverage     78.35%   78.35%           
+ Complexity     6691     6689    -2     
=========================================
  Files           756      756           
  Lines         22212    22203    -9     
  Branches       4363     4365    +2     
=========================================
- Hits          17405    17398    -7     
+ Misses         4107     4106    -1     
+ Partials        700      699    -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[Navadeep0007]

@DenizAltunkapan could you please review into my PR,
I appreciate your efforts!

[DenizAltunkapan]

Thanks @Navadeep0007