input: Write a function to generate and print all prime numbers between 1 and a given number n. If n is less than 2, print an empty line.
  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):
          if prime_list[p]:
              print(p)
  
  assert generate_prime_numbers(10)
  assert generate_prime_numbers(20)
  assert generate_prime_numbers(1)
  assert generate_prime_numbers(2)
  assert generate_prime_numbers(0)
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):
          if prime_list[p]:
              print(p)