The Sieve of Erathosthenes is an algorithm used to calculate prime number to a certain range

SOE.py

# maximum range
n = 100

# prime numbers
primes = []

numbers = list(range(2, n+1))

while numbers:

    # Assume the first number is prime
    prime = numbers.pop(0)
    primes.append(prime)

    # remove all numbers divisible by the prime number
    numbers = [ x for x in numbers if x % prime != 0 ]

print(primes)

# [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

"""
The time complexity of the Sieve of Eratosthenes algorithm is O(n log log n). 
"""