Last active
March 4, 2018 17:32
-
-
Save kimwalisch/3d709ae746a894e3e98723a0fe42864c to your computer and use it in GitHub Desktop.
Identify primes
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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