






def     lowerCamelCase__				(   __lowerCamelCase      :					int  ,		__lowerCamelCase      :					int  ,		__lowerCamelCase      :					int		):
  if common_ratio == 1:
    # Formula for sum if common ratio is 1
    return num_of_terms * first_term

  # Formula for finding sum of n terms of a GeometricProgression
  return (first_term / (1 - common_ratio)) * (1 - common_ratio**num_of_terms)










def     lowerCamelCase__				(   __lowerCamelCase      :					list		):
  if len(__lowerCamelCase		) <= 1:
    return data
  else:
    return [
        *quick_sort([e for e in data[1:] if e <= data[0]]		),
        data[0],
        *quick_sort([e for e in data[1:] if e > data[0]]		),
    ]


if __name__ == "__main__":
       import doctest

       doctest.testmod()


