Talk:Sieve of Eratosthenes: Difference between revisions

... Hmm, I'm not sure. If by primality check you mean the line "if(isPrime[i])" then it is doing the same work of the posted code's "nums.remove()" (finding the next valid prime to begin marking, it is not a method merely a reference to the array) only much more efficiently. Also my code is much truer to the algorithm (in terms of algorithmic description, pseudocode, end representation (having a marked list of values and a separate list of collected primes by the end of the run) and performance) as described in [http://en.wikipedia.org/wiki/Sieve_of_eratosthenes Wikipedia - Sieve of Eratosthenes] than the posted code. I don't know where you got the requirement that composites must be removed, the original algorithm merely states they must be '''marked iteratively'''.