input: Write a function to print all prime numbers between 1 and a given number n using the Sieve of Eratosthenes algorithm. If the input number n is less than 2, print an empty list.
  
  def generate_prime_numbers(n):
      if n < 2:
          print([])
          return
    
      prime_list = [True for i in range(n + 1)] 
      p = 2
      while (p * p <= n): 
          if prime_list[p] == True: 
              for i in range(p * 2, n + 1, p): 
                  prime_list[i] = False
          p += 1
    
      for p in range(2, n + 1): 
          if prime_list[p]: 
              print(p)
  
  assert generate_prime_numbers(10)==None
  # Output: 2 3 5 7
  
  assert generate_prime_numbers(0)==None
  # Output: []
  
  assert generate_prime_numbers(3)==None
  # Output: 2 3
output: def generate_prime_numbers(n):
      if n < 2:
          print([])
          return
    
      prime_list = [True for i in range(n + 1)] 
      p = 2
      while (p * p <= n): 
          if prime_list[p] == True: 
              for i in range(p * 2, n + 1, p): 
                  prime_list[i] = False
          p += 1
    
      for p in range(2, n + 1): 
          if prime_list[p]: 
              print(p)