I had a bad experience with the Sieve of Eratosthenes during a college test. I became traumatized by it and tried to avoid it. During this holiday break I successfully implemented it ruby
My favorite parts of this algorithm were:
* The fact that I don’t have to iterate the whole sieve! I can do it just for _sqrt(n) _since the factors of any number are always composed by two numbers and one of them is always lower than the _sqrt_ of any given number n.
* The usage of ruby’s inline _if _statements