For large, the range of primes may not fit in memory; worse, even for moderate, its cache use is highly suboptimal: the algorithm walks through the entire array, exhibiting almost no locality of reference.
The range of primes may not fit in memory. This is for large. Worse its cache use is highly suboptimal. This is even for moderate. The algorithm walks through the entire array. The algorithm is exhibiting almost no locality of reference.