Skip to content

Instantly share code, notes, and snippets.

@dougyoung
Created November 12, 2013 18:47
Show Gist options
  • Save dougyoung/7436482 to your computer and use it in GitHub Desktop.
Save dougyoung/7436482 to your computer and use it in GitHub Desktop.
Prime number sieve
def prime_number_sieve(n)
primes = []
integers_up_to_n = (2..n).to_a
integers_up_to_n.each do |i|
next if i.nil?
primes << i
not_prime = i + i
while (not_prime <= n) do
integers_up_to_n[not_prime - 2] = nil
not_prime = not_prime + i
end
end
primes
end
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment