input: 
  def test_sieve_eratosthenes(): 
      assert sieve_eratosthenes(10) == [2, 3, 5, 7]
      assert sieve_eratosthenes(20) == [2, 3, 5, 7, 11, 13, 17, 19]
      assert sieve_eratosthenes(50) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
      assert sieve_eratosthenes(100) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
  
output:     
  def sieve_eratosthenes(n: int) -> List[int]:
      if n < 2:
          return []
      is_prime = [True] * (n + 1)
      p = 2
      while (p * p <= n):
          if (is_prime[p] == True):
              for i in range(p * p, n + 1, p):
                  is_prime[i] = False
          p += 1
      prime_numbers = [p for p in range(2, n + 1) if is_prime[p]]
      return prime_numbers
  