Closed ADHIRAJ-12 closed 11 months ago
Sieve Algo For obtaining Primes.
Time Complexity – O(n*(log(log(n)))) Space Complexity – Auxiliary Space – O(n)
The code looks good to me. Merging it.
🥳 Happy Hacking
Sieve Algo For obtaining Primes.
Time Complexity – O(n*(log(log(n)))) Space Complexity – Auxiliary Space – O(n)