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

2 votes125 views1 answer
Convert int to byte python
Python
0 vote116 views1 answer
Python pandas get dataframe element
Python
0 vote107 views1 answer
Violin Plots, Python
Python
1 vote168 views1 answer
Install postgres for python mac
Python
0 vote116 views1 answer
Creating new column with dictionary
Python
1 vote119 views3 answers
How to get today weekday in python
Python
7 votes113 views4 answers
Python timer()
Python
7 votes108 views5 answers
How to multiply two lists in python
Python
2 votes110 views1 answer
How to change windows icon tkinter
Python
1 vote118 views1 answer
Np where nan
Python