1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
fn eratosthenes(n) {
primes = [];
// init with all numbers marked as prime
i = 2;
while i <= n {
primes << true;
i = i + 1;
}
// sieve
i = 2;
while i <= n {
if primes[i - 2] {
k = i * 2;
while k <= n {
primes[k - 2] = false;
k = i + k;
}
}
i = i + 1;
}
// collect results
result = [];
i = 2;
while i <= n {
if primes[i - 2] {
result << i;
}
i = i + 1;
}
return result;
}
print(eratosthenes(1000));