@schsam woah, that's pretty cool! I guess I should I learn it.

I can speak for myself, tet5uo, but solving problems and reading other coders smart solutions surely helped me in creating smarter and more "compressed" code.

A LOT.

Not that it is always best practice (on the contrary, often...), but it is an excellent training ground for abstraction skills and syntax proficiency.

I am confused: according to wiki it does not seem that faster (while it is certainly more complex to implement) than the old SoE, then I wonder how it would perform against a SoE testing just odd numbers in the form 6k+/-1.

Spaghetti.... jummy :D

The Sieve of Atkin is faster: https://en.wikipedia.org/wiki/Sieve_of_Atkin

Yeah mine does that a lot too. Something about pasting code into the editor you wrote in something else seems to destroy the indentation.

Yes, often you'll see 1/0 replaced for true/false when someone is using binary to store some boolean values.

Think of what other values can be usually interchanged for true/false

Thanks. That is indeed bitchin!

Well I just was pointed out a critical flaw in the way my solution works. It passes all the tests, but in doing so I'm actually mutating the original arrays unwittingly.

Perhaps you could add tests that make sure the original arrays aren't modified.

My solution is written very long and verbose compared to the top one , but it made me feel a bit better when mine seemed to be much faster.

How do you guys get so good at compressing things into such compact code :D