Anonymous user
Ascending primes: Difference between revisions
→Queue-based solution that does not need sorting.
Line 1,277:
<lang python>def isprime(n):
if n == 2: return True
if
root1 = int(n**0.5) + 1;
for k in range(3, root1, 2):
|