feat: add Sieve of Eratosthenes algorithm (#7071)
* feat: add Sieve of Eratosthenes algorithm - Implement Sieve of Eratosthenes for finding prime numbers up to n - Add comprehensive unit tests with edge cases - Include JavaDoc documentation - Time complexity: O(n log log n) - Space complexity: O(n) Resolves #6939 * fix: remove trailing spaces * fix: apply clang-format
G
GOPISETTI NAVADEEP committed
c6880c195d778b1d19fc13d4be1ae09dc355de2f
Parent: 9381161
Committed by GitHub <noreply@github.com>
on 11/16/2025, 12:00:21 PM