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

24 votes141 views2 answers
Find python
Python
3 votes153 views3 answers
Python basename
Python
0 vote187 views1 answer
Pandas set font size plot
Python
4 votes131 views2 answers
Python thread pool
Python
18 votes131 views4 answers
Edit path variable using python
Python
0 vote150 views1 answer
How to add twoo segmen time series in a single plot
Python
0 vote158 views1 answer
Save list pickle
Python
1 vote168 views1 answer
Pydotprint
Python
0 vote170 views1 answer
Multiprocessing map
Python
1 vote145 views1 answer
Why is there a lot of numbers in python
Python