Skip to content

Instantly share code, notes, and snippets.

@kimwalisch
Last active March 4, 2018 17:32
Show Gist options
  • Save kimwalisch/3d709ae746a894e3e98723a0fe42864c to your computer and use it in GitHub Desktop.
Save kimwalisch/3d709ae746a894e3e98723a0fe42864c to your computer and use it in GitHub Desktop.
Identify primes
for (; n <= high; n += 2)
if (sieve[n - low]) // n is a prime
count++;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment