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

1 vote372 views1 answer
User group template tag django
Python Django
0 vote340 views1 answer
Pyspark pivot max aggregation
Python
4 votes328 views2 answers
Print prime numbers from 1 to 100 in python in single line
Python
5 votes318 views6 answers
How to find unique values in numpy array
Python
0 vote302 views1 answer
/usr/local/lib/python3.7/dist-packages/pytube/captions.py in xml_caption_to_srt(self, xml_captions)
Python
4 votes352 views1 answer
How to address a column in a 2d array python
Python
0 vote339 views1 answer
Python byte like to string
Python
-1 vote331 views2 answers
Insert into string python more than one
Python
0 vote344 views2 answers
Python min value index from an array
Python
0 vote327 views1 answer
Csrf token fetch django
Python Django