hey we all know that Sieve of Eratosthenes takes O(N log (log N)) but in one of the article of geeksforgeeks Sieve of Eratosthenes takes O(N) time and they have also provided explanation source code.↵
[Here is the link [Your text to link here...](https://www.geeksforgeeks.org/sieve-eratosthenes-0n-time-complexity/)↵
is it possible in O(N) if yes then explain
[Here is the link
is it possible in O(N) if yes then explain