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 vote307 views1 answer
Tqdm for jupyter notebook
Python
2 votes274 views1 answer
Pygame how to regulate fps
Python
0 vote326 views1 answer
Broadcast in python
Python
0 vote283 views1 answer
Run ipython inside pipenv
Python
0 vote292 views1 answer
Matruzen rechner python
Python
1 vote271 views1 answer
Numpy array heaviside float values to 0 or 1
Python
0 vote318 views1 answer
How to run django tests
Python Django
6 votes250 views2 answers
Write a python program to print all unique values in a dictionary
Python
0 vote284 views2 answers
Flask get summernote text
Python
0 vote305 views1 answer
Python save console state
Python