There is another way given at geeks…
But looking at the code its time complexity should be o(sqrt(n).n)…not that is given O(n*log(log(n)))
Geeks sieve eratosthenes approach
complexity is O(n*log(log(n)))
we are only iterating on multiples of prime…
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.