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

0 vote180 views1 answer
Matplotlib random color
Python
3 votes184 views1 answer
From collections import defaultdict
Python
3 votes189 views2 answers
Pandas remove time from date
Python
0 vote182 views1 answer
Find python background process id
Python
0 vote194 views1 answer
Python message from byte
Python
1 vote191 views1 answer
Python - removeempy space in a cell
Python
2 votes200 views2 answers
Pandas create column from another column
Python
4 votes186 views2 answers
Median of a list python
Python
14 votes218 views1 answer
How to find the version of python command linw
Python
1 vote209 views1 answer
That, given an array a of n integers, returns the smallest positive integer (greater than 0) that does not occur in a. python
Python