input: Write a function to print all prime numbers between 1 and a given number n. If n is less than or equal to 1, the function should print nothing.
  def generate_prime_numbers(n):
    
      # Array for checking if a number is prime or not
      prime_list = [True for i in range(n + 1)] 
      p = 2
      while (p * p <= n): 
            
          # If prime_list[p] is not changed, then it is a prime 
          if (prime_list[p] == True): 
                
              # Update all multiples of p 
              for i in range(p * 2, n + 1, p): 
                  prime_list[i] = False
          p += 1
    
      # Collecting prime numbers 
      for p in range(2, n): 
          if prime_list[p]: 
              print(p)
  
  assert generate_prime_numbers(10)   # Expected output: 2 3 5 7
  assert generate_prime_numbers(1)    # Expected output: (nothing)
  assert generate_prime_numbers(20)   # Expected output: 2 3 5 7 11 13 17 19
  assert generate_prime_numbers(0)    # Expected output: (nothing)
  assert generate_prime_numbers(-5)   # Expected output: (nothing)
output: def generate_prime_numbers(n):
      if n <= 1:
          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)