




from scipy.constants import g


def 						lowerCamelCase__   (		_A					,     _A							):







	'''simple docstring'''





	if mass < 0:
		# handling of negative values of mass
		raise ValueError("The mass of a body cannot be negative"							)
	if height < 0:
		# handling of negative values of height
		raise ValueError("The height above the ground cannot be negative"							)
	return mass * g * height


if __name__ == "__main__":
		from doctest import testmod

		testmod(name="potential_energy")






def 						lowerCamelCase__   (		_A					,     _A					,     _A							):







	'''simple docstring'''





	if right <= left:
		return
	snake_case_		   =					snake_case_		   =					left
	snake_case_		   =					right
	snake_case_		   =					sorting[left]
	while i <= b:
		if sorting[i] < pivot:
			snake_case_   ,				snake_case_		   =					sorting[i], sorting[a]
			a += 1
			i += 1
		elif sorting[i] > pivot:
			snake_case_   ,				snake_case_		   =					sorting[i], sorting[b]
			b -= 1
		else:
			i += 1
	quick_sort_apartition(_A					,     _A					,     a - 1							)
	quick_sort_apartition(_A					,     b + 1					,     _A							)


def 						lowerCamelCase__   (		_A					,     _A					,     _A							):







	'''simple docstring'''





	if left < right:
		snake_case_		   =					lomuto_partition(_A					,     _A					,     _A							)
		quick_sort_lomuto_partition(_A					,     _A					,     pivot_index - 1							)
		quick_sort_lomuto_partition(_A					,     pivot_index + 1					,     _A							)


def 						lowerCamelCase__   (		_A					,     _A					,     _A							):







	'''simple docstring'''





	snake_case_		   =					sorting[right]
	snake_case_		   =					left
	for i in range(_A					,     _A							):
		if sorting[i] < pivot:
			snake_case_   ,				snake_case_		   =					sorting[i], sorting[store_index]
			store_index += 1
	snake_case_   ,				snake_case_		   =					sorting[store_index], sorting[right]
	return store_index


def 						lowerCamelCase__   (		_A							):







	'''simple docstring'''





	if len(_A							) <= 1:
		return sorting
	return (
	    three_way_radix_quicksort([i for i in sorting if i < sorting[0]]							)
	    + [i for i in sorting if i == sorting[0]]
	    + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]							)
	)


if __name__ == "__main__":
		import doctest

		doctest.testmod(verbose=True)

		lowercase__    :					Tuple					=						input("Enter numbers separated by a comma:\n").strip()
		lowercase__    :					int					=						[int(item) for item in user_input.split(",")]
		quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
		print(unsorted)
