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

5 votes130 views2 answers
How to empty a text file in python
Python
1 vote130 views1 answer
Python cmath constants
Python
42 votes135 views3 answers
Python3 main.py
Python
0 vote153 views1 answer
Binary table dataframe
Python
19 votes151 views2 answers
Palindrome string python
Python
0 vote133 views1 answer
.lstrip()
Python
0 vote213 views1 answer
Install python 3.9 centos8
Python
0 vote108 views1 answer
Django auto increment field not primary key
Python Django
0 vote140 views1 answer
Python write data to file with permissions
Python
0 vote124 views1 answer
Selecting letters in a row
Python