Sieve of Pritchard: Difference between revisions

m
→‎{{header|Julia}}: change for loop
m (→‎{{header|Julia}}: change for loop)
Line 186:
=={{header|Julia}}==
With the add/remove statistics, the "Removed" figure is a combination of composites and primes under sqrt of limit. Getting about
a 40%30x speedup from using a BitArray instead of a Set and integer-range-only for loops.
<syntaxhighlight lang="julia">""" Rosetta Code task rosettacode.org/wiki/Sieve_of_Pritchard """
 
Line 203:
# the last partial wheel (if present)
if steplength < limit
for w in [i for i in eachindex(members) if members[i]]1:limit*2
n =if members[w + steplength]
while n <= nlimitw + steplength
members[while n] <= truenlimit
ac + members[n] = 1true
n ac += steplength1
n += steplength
end
end
end
Line 214 ⟶ 216:
end
np = 5
for w in [i for i in eachindex(members) if members[i]]1:limit*2
np == 5 && w > prime && (np =if members[w)]
n np == 5 && w > prime *&& (np = w)
n >= nlimitprime &&* breakw
rc += 1 n > nlimit && break
members[n] rc += false1
members[n] = false
end
end
np < prime && break
4,105

edits