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

12 votes164 views4 answers
Python algorithm generator
Python
0 vote222 views1 answer
Train slipt sklearn
Python
1 vote209 views2 answers
Pytorch view -1 meaning
Python
3 votes167 views1 answer
How clear everything on canvas in tkinter
Python
60 votes188 views5 answers
Python arguments
Python
1 vote184 views3 answers
Program to draw rectangle in python
Python
6 votes174 views1 answer
Cv2 resize
Python
11 votes184 views2 answers
How to get frequency of each elements in a python list
Python
1 vote169 views3 answers
Making ckeditor django responsive
Python
9 votes178 views1 answer
Flask tutorials
Python