Noratrieb/benchmarks
1
0
Fork 0
mirror of https://github.com/Noratrieb/benchmarks.git synced 2026-01-14 18:55:02 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

checks every second number

Browse source
This commit is contained in:
CORR1T 2021-06-07 15:38:06 +02:00
parent dfce13e6bc
commit 12ec3b5d1b
2 changed files with 9 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

7
primes/java/src/DefaultPrimes.java
View file

@ -6,15 +6,16 @@ public class DefaultPrimes implements Primes {
// (will make the code 15% slower)
@SuppressWarnings("ForLoopReplaceableByForEach")
public List<Integer> primes(int max) {
List<Integer> primesList = new ArrayList<>(10000);
List<Integer> primesList = new ArrayList<>(max);
primesList.add(2);
for (int i = 3; i < max; i++) { //go through all numbers
for (int i = 3; i < max; i += 2) { //go through all numbers
boolean isPrime = true;
double sqrRoot = Math.sqrt(i);
for (int j = 0; j < primesList.size(); j++) { //test each number
int prime = primesList.get(j);
if (prime > Math.sqrt(i)) {
if (prime >= sqrRoot) {
break;
}
if (i % prime == 0) { //i = test number, j = some known prime