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 vote144 views1 answer
Go to line in jetbrain
Python
1 vote137 views3 answers
Django logout user
Python
1 vote86 views1 answer
_reverse_with_prefix() argument after * must be an iterable, not int
Python
1 vote146 views1 answer
Python alphabet to number
Python
6 votes146 views4 answers
Google Translate English to Spanish
Python
0 vote124 views1 answer
Creating rest api in serverless with python
Python
0 vote119 views1 answer
Pygame mixer documentation
Python
0 vote131 views1 answer
Python countdown from 20 down to 0
Python
1 vote164 views1 answer
Snowflake python connector error handling
Python
1 vote153 views1 answer
How many columns can a pandas dataframe have
Python