How to get prime list by Python

Sieve of Eratosthenes

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, n + 1):
        for j in range(i * 2, n + 1, i):
            # Exclude j from candidate of prime.
            # j = i * k
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

Sieve of Eratosthenes (optimized)

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            # Exclude j from candidate of prime.
            # j = i * k
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]