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 votes348 views2 answers
How to delete all pips
Python
0 vote420 views1 answer
Binary to decimal in Python without inbuilt function
Python
8 votes348 views1 answer
Remove strings from a list python if they're too small
Python
3 votes348 views1 answer
How to remove quotes from a string in python
Python
9 votes362 views2 answers
Display maximum columns pandas
Python
0 vote314 views1 answer
Function that return a lenght of list
Python
36 votes346 views1 answer
Sleep in py
Python
2 votes348 views2 answers
Python check if key exist in json
Python
1 vote390 views2 answers
Dfs algorithm python
Python
0 vote351 views1 answer
Pandas legend placement
Python