Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with primes
Search options not deleted
user 74861
Primes or prime numbers are numbers which are divisible only by themselves and one, starting with 2, 3, 5, 7, 11.... They are commonly used in encryption and hashing algorithms.
4
votes
1
answer
265
views
Windowed Sieve of Eratosthenes in Java
primes[i])
continue;
for (int j = i * i; j <= upperBound; j += i) {
primes[j] = false;
}
if (primes[i])
numbers.add( … primes[j] || (j + lowerBound) == tmp)
continue;
primes[j] = false;
}
}
for (int i = 0; i < primes.length; i++) {
if (primes[ …
- 823