Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- from array_queue import ArrayQueue
- def sieve(n):
- primes = [True for i in range(n + 2)]
- p = 2
- while p * p <= n:
- # If prime[p] is not changed, then it is a prime
- if primes[p]:
- # Update all multiples of p
- for i in range(p * 2, n + 2, p):
- primes[i] = False
- p += 1
- # returns the list of primes unto n
- return [i for i in range(2, n + 1) if primes[i] == True]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement