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, the function should print nothing.
  assert generate_prime_numbers(10)  # Should print: 2 3 5 7
  assert generate_prime_numbers(0)   # Should print: nothing
  assert generate_prime_numbers(20)  # Should print: 2 3 5 7 11 13 17 19
  assert generate_prime_numbers(1)   # Should print: nothing
  assert generate_prime_numbers(15)  # Should print: 2 3 5 7 11 13
output: def generate_prime_numbers(n):
      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
      for p in range(2, n + 1):
          if is_prime[p]:
              print(p, end=" ")