





"""simple docstring"""


def 				a__      (	_UpperCAmelCase						)     ->	list:

 '''simple docstring'''






 if len(_UpperCAmelCase						) <= 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()








"""simple docstring"""


def 				a__      (	_UpperCAmelCase						,  _UpperCAmelCase						,  _UpperCAmelCase						)     ->	float:

 '''simple docstring'''






 snake_case__     				=					[1 / first_term]
 snake_case__     				=					1 / first_term
 for _ in range(number_of_terms - 1						):
  first_term += common_difference
  arithmetic_progression.append(_UpperCAmelCase						)
 snake_case__     				=					[1 / step for step in arithmetic_progression]
 return sum(_UpperCAmelCase						)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(sum_of_harmonic_progression(1 / 2, 2, 2))

