Just take a look at the Naive Prime Generator. I know they call it Naive, but its very naive. To the point where if its checking if i is prime, it tries to see if number greater than i evenly divide it!
There are other optimizations they could toss in there (e.g. since they keep an array of prime numbers they need only divide by those) but you could try to argue that these make the code harder to understand... so for those I'm willing to give a pass.
Comments
The implementaions here don't look that great.
Just take a look at the Naive Prime Generator. I know they call it Naive, but its very naive. To the point where if its checking if i is prime, it tries to see if number greater than i evenly divide it!
There are other optimizations they could toss in there (e.g. since they keep an array of prime numbers they need only divide by those) but you could try to argue that these make the code harder to understand... so for those I'm willing to give a pass.