





"""simple docstring"""




from torch import nn


class 			__UpperCamelCase							(		nn.Module		):






							def __init__(  self ,   lowerCAmelCase__ ,   lowerCAmelCase__ )      ->					Dict:
								super().__init__()
								a :						Optional[int]      =							class_size
								a :						Tuple      =							embed_size
								# self.mlp1 = nn.Linear(embed_size, embed_size)
								# self.mlp2 = (nn.Linear(embed_size, class_size))
								a :						Optional[Any]      =							nn.Linear(lowerCAmelCase__ ,   lowerCAmelCase__ )






							def        __a  (  self ,   lowerCAmelCase__ )      ->					Dict:
								# hidden_state = nn.functional.relu(self.mlp1(hidden_state))
								# hidden_state = self.mlp2(hidden_state)
								a :						Optional[int]      =							self.mlp(lowerCAmelCase__ )
								return logits









"""simple docstring"""




import math






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int = 0       ,			_lowercase		:       int = 0   )					->list:






	'''simple docstring'''






	a :						Optional[Any]      =							end or len(_lowercase   )
	for i in range(_lowercase       ,			_lowercase   ):
		a :						List[str]      =							i
		a :						Any      =							array[i]
		while temp_index != start and temp_index_value < array[temp_index - 1]:
			a :						Optional[Any]      =							array[temp_index - 1]
			temp_index -= 1
		a :						Any      =							temp_index_value
	return array






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->None:  # Max Heap






	'''simple docstring'''






	a :						Tuple      =							index
	a :						List[Any]      =							2 * index + 1  # Left Node
	a :						Dict      =							2 * index + 2  # Right Node

	if left_index < heap_size and array[largest] < array[left_index]:
		a :						Dict      =							left_index

	if right_index < heap_size and array[largest] < array[right_index]:
		a :						int      =							right_index

	if largest != index:
		a,			a :						List[Any]      =							array[largest], array[index]
		heapify(_lowercase       ,			_lowercase       ,			_lowercase   )






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list   )					->list:






	'''simple docstring'''






	a :						int      =							len(_lowercase   )

	for i in range(n // 2       ,			-1       ,			-1   ):
		heapify(_lowercase       ,			_lowercase       ,			_lowercase   )

	for i in range(n - 1       ,			0       ,			-1   ):
		a,			a :						str      =							array[0], array[i]
		heapify(_lowercase       ,			0       ,			_lowercase   )

	return array






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->int:






	'''simple docstring'''






	if (array[first_index] > array[middle_index]) != (
	    array[first_index] > array[last_index]
	):
		return array[first_index]
	elif (array[middle_index] > array[first_index]) != (
	    array[middle_index] > array[last_index]
	):
		return array[middle_index]
	else:
		return array[last_index]






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->int:






	'''simple docstring'''






	a :						List[Any]      =							low
	a :						int      =							high
	while True:
		while array[i] < pivot:
			i += 1
		j -= 1
		while pivot < array[j]:
			j -= 1
		if i >= j:
			return i
		a,			a :						Union[str, Any]      =							array[j], array[i]
		i += 1






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list   )					->list:






	'''simple docstring'''






	if len(_lowercase   ) == 0:
		return array
	a :						Tuple      =							2 * math.ceil(math.loga(len(_lowercase   )   )   )
	a :						List[str]      =							16
	return intro_sort(_lowercase       ,			0       ,			len(_lowercase   )       ,			_lowercase       ,			_lowercase   )






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->list:






	'''simple docstring'''






	while end - start > size_threshold:
		if max_depth == 0:
			return heap_sort(_lowercase   )
		max_depth -= 1
		a :						List[str]      =							median_of_a(_lowercase       ,			_lowercase       ,			start + ((end - start) // 2) + 1       ,			end - 1   )
		a :						Tuple      =							partition(_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase   )
		intro_sort(_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase   )
		a :						Union[str, Any]      =							p
	return insertion_sort(_lowercase       ,			_lowercase       ,			_lowercase   )


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		a		:					Optional[int]	      =     input('''Enter numbers separated by a comma : ''').strip()
		a		:					List[str]	      =     [float(item) for item in user_input.split(''',''')]
		print(sort(unsorted))


