Sieve of eratosthenes python

# sieve of eratosthenes 
def SieveOfEratosthenes(n):
    prime = [True for i in range(n + 1)]
    p = 2
    while (p * p <= n):
        if (prime[p] == True):
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 1
    prime[0] = False
    prime[1] = False
    r = []
    for p in range(n + 1):
        if prime[p]:
            r.append(p)
    return r

n = int(input("Get primes in range of?- "))
listOfPrime = SieveOfEratosthenes(n)
count = 1
# print primes 1-100 then 101-200 etc. in different line
for i in listOfPrime:
    if i > 100 * count:
        count += 1
        print()
    print(i, end = " ")

Similar codes

2 votes243 views1 answer
Pytorch tensor change dimension order
Python
1 vote198 views2 answers
What is a cube plus b cube
Python
2 votes221 views2 answers
How to check django rest framework version
Python
8 votes183 views3 answers
Python execute function from string
Python
0 vote190 views1 answer
Enumerate in range python
Python
0 vote192 views1 answer
Python selenium class
Python
1 vote225 views1 answer
Flask socketio usage
Python Flask
1 vote191 views1 answer
Install pandas in python on ubuntu
Python
155 votes281 views6 answers
Python os if file exists
Python
0 vote200 views3 answers
Pow
Python