input: Write a function to generate a list of prime numbers from 1 to 100 using the Sieve of Eratosthenes algorithm. The function should return the list of prime numbers.
  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]
  assert sieve_eratosthenes(50)==[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
  assert sieve_eratosthenes(10)==[2, 3, 5, 7]
  assert sieve_eratosthenes(2)==[2]
  assert sieve_eratosthenes(1)==[]
output: def sieve_eratosthenes(n):
      if n < 2:
          return []
      sieve = [True] * (n + 1)
      sieve[0] = sieve[1] = False
      for i in range(2, int(n**0.5) + 1):
          if sieve[i]:
              for j in range(i*i, n + 1, i):
                  sieve[j] = False
      return [i for i in range(n + 1) if sieve[i]]