Prime number within a given range

def primes_in_range_opt(l: int, r: int) -> list:
    # Sieve of Eratosthenes
    if r < 2: return []
    sieve = [True] * (r + 1)
    sieve[0] = sieve[1] = False
    for p in range(2, int(r**0.5) + 1):
        if sieve[p]:
            for i in range(p * p, r + 1, p):
                sieve[i] = False
    return [p for p in range(max(2, l), r + 1) if sieve[p]]

def primes_in_range_brute(l: int, r: int) -> list:
    res = []
    for num in range(max(2, l), r + 1):
        is_p = True
        for i in range(2, num):
            if num % i == 0:
                is_p = False
                break
        if is_p:
            res.append(num)
    return res