Sieve of Eratosthenes in Python

sieve.py

def simple_sieve(limit):
    is_prime = [True] * (limit + 1)

    for n in range(2, limit + 1):
        if is_prime[n]:
            for m in range(n * n, limit + 1, n):
                is_prime[m] = False
    
    return [n for n in range(2, limit + 1) if is_prime[n]]


def main():
    primes = simple_sieve(100)
    print(primes)


if __name__ == '__main__':
    main()