Sieve of Eratosthenes: Difference between revisions
Content added Content deleted
(Added Euler) |
|||
Line 5,757: | Line 5,757: | ||
max = sqrt len is_divisible[] |
max = sqrt len is_divisible[] |
||
for d = 2 to max |
for d = 2 to max |
||
if is_divisible[d] = 0 |
if is_divisible[d] = 0 |
||
for i = d * d step d to len is_divisible[] |
for i = d * d step d to len is_divisible[] |
||
is_divisible[i] = 1 |
is_divisible[i] = 1 |
||
. |
. |
||
. |
. |
||
. |
. |
||
for i = 2 to len is_divisible[] |
for i = 2 to len is_divisible[] |
||
if is_divisible[i] = 0 |
if is_divisible[i] = 0 |
||
print i |
print i |
||
. |
. |
||
⚫ | |||
. |
|||
⚫ | |||
=={{header|eC}}== |
=={{header|eC}}== |