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 vote105 views1 answer
Python tf.maximum
Python
6 votes108 views5 answers
How to redirect in django
Python
0 vote101 views1 answer
When button is clicked tkinter python
Python
0 vote102 views1 answer
If short for python
Python
0 vote100 views2 answers
Sqlite to python list
Python
0 vote99 views1 answer
Else statement python list comprehension
Python
0 vote158 views1 answer
All Combinations
Python
7 votes111 views3 answers
Concat dataframes
Python
0 vote60 views1 answer
Fibonacci sequence in python
Python
4 votes103 views2 answers
Django queryset group by
Python