input: Write a function to generate a list of prime numbers between 1 and a given number n. The function should return a list of all prime numbers found. If n is less than or equal to 1, the function should return an empty list.
  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
    
      primes = []
      for p in range(2, n): 
          if prime_list[p]: 
              primes.append(p)
      
      return primes
  
  assert generate_prime_numbers(10) == [2, 3, 5, 7]
  assert generate_prime_numbers(2) == []
  assert generate_prime_numbers(1) == []
  assert generate_prime_numbers(0) == []
  assert generate_prime_numbers(20) == [2, 3, 5, 7, 11, 13, 17, 19]
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
    
      primes = []
      for p in range(2, n): 
          if prime_list[p]: 
              primes.append(p)
      
      return primes