3 ms·
Filling the Sieve has a time complexity of O(n log log n), and accessing a value is clearly O(1). This is far away from that.
by baristaGeek 10y ago
Filling the Sieve has a time complexity of O(n log log n), and accessing a value is clearly O(1). This is far away from that.