Sieve of Eratosthenes (based on https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)

sieve.py

from math import floor, sqrt
from typing import List


def sieve(n: int) -> List[int]:
    A: List[bool] = [True] * n

    for i in range(2, floor(sqrt(n) + 1), 1):
        if A[i]:
            for j in range(i ** 2, n, i):
                A[j] = False

    primes: List[int] = []

    for i, is_prime in zip(range(len(A)), A):
        if is_prime:
            primes.append(i)

    return primes[2:]