



from math import exp




def    UpperCAmelCase					(  lowercase__						:					float	):



			'''simple docstring'''





			return 8 * x - 2 * exp(-x	)




def    UpperCAmelCase					(  lowercase__						:					float				,					lowercase__						:					float				,					lowercase__						:					int	):



			'''simple docstring'''





			a__					=  lower_bound
			a__					=  upper_bound
			for _ in range(0				,					lowercase__	):
						a__				,       a__					=  xa, xa - (f(lowercase__	) * (xa - xa)) / (f(lowercase__	) - f(lowercase__	))
			return xa


if __name__ == "__main__":
	print(f'''Example: {secant_method(1, 3, 2)}''')






'''simple docstring'''



from __future__ import annotations

from random import randrange



def 	__lowerCAmelCase       (				lowerCamelCase :    list       ):






	'''simple docstring'''




	if len(lowerCamelCase       ) < 2:
		return collection
	__lowerCAmelCase       				=	randrange(len(lowerCamelCase       )       )  # Use random element as pivot
	__lowerCAmelCase       				=	collection[pivot_index]
	__lowerCAmelCase       				=	[]  # All elements greater than pivot
	__lowerCAmelCase       				=	[]  # All elements less than or equal to pivot

	for element in collection[:pivot_index]:
		(greater if element > pivot else lesser).append(lowerCamelCase       )

	for element in collection[pivot_index + 1 :]:
		(greater if element > pivot else lesser).append(lowerCamelCase       )

	return [*quick_sort(lowerCamelCase       ), pivot, *quick_sort(lowerCamelCase       )]


if __name__ == "__main__":
	lowerCAmelCase						:		List[Any]						      = input('''Enter numbers separated by a comma:\n''').strip()
	lowerCAmelCase						:		Any						      = [int(item) for item in user_input.split(''',''')]
	print(quick_sort(unsorted))