Sieve of Eratosthenes Python implementation

eratosthenes.py

from typing import Iterator


def sieve(n: int) -> Iterator[int]:
    if n < 2:
        return

    primes = [True for _ in range(n + 1)]

    for p in range(2, n + 1):
        if primes[p]:
            yield p
            for i in range(p * p, n + 1, p):
                primes[i] = False