
import math





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__ = 0	, lowerCamelCase__ = 0    ):
				lowerCamelCase_						=			end or len(lowerCamelCase__    )
				for i in range(lowerCamelCase__	, lowerCamelCase__    ):
								lowerCamelCase_						=			i
								lowerCamelCase_						=			array[i]
								while temp_index != start and temp_index_value < array[temp_index - 1]:
												lowerCamelCase_						=			array[temp_index - 1]
												temp_index -= 1
								lowerCamelCase_						=			temp_index_value
				return array





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):  # Max Heap
				lowerCamelCase_						=			index
				lowerCamelCase_						=			2 * index + 1  # Left Node
				lowerCamelCase_						=			2 * index + 2  # Right Node

				if left_index < heap_size and array[largest] < array[left_index]:
								lowerCamelCase_						=			left_index

				if right_index < heap_size and array[largest] < array[right_index]:
								lowerCamelCase_						=			right_index

				if largest != index:
								lowerCamelCase_	,    lowerCamelCase_						=			array[largest], array[index]
								heapify(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			len(lowerCamelCase__    )

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

				for i in range(n - 1	, 0	, -1    ):
								lowerCamelCase_	,    lowerCamelCase_						=			array[0], array[i]
								heapify(lowerCamelCase__	, 0	, lowerCamelCase__    )

				return array





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				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 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				lowerCamelCase_						=			low
				lowerCamelCase_						=			high
				while True:
								while array[i] < pivot:
												i += 1
								j -= 1
								while pivot < array[j]:
												j -= 1
								if i >= j:
												return i
								lowerCamelCase_	,    lowerCamelCase_						=			array[j], array[i]
								i += 1





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				if len(lowerCamelCase__    ) == 0:
								return array
				lowerCamelCase_						=			2 * math.ceil(math.loga(len(lowerCamelCase__    )    )    )
				lowerCamelCase_						=			1_6
				return intro_sort(lowerCamelCase__	, 0	, len(lowerCamelCase__    )	, lowerCamelCase__	, lowerCamelCase__    )





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				while end - start > size_threshold:
								if max_depth == 0:
												return heap_sort(lowerCamelCase__    )
								max_depth -= 1
								lowerCamelCase_						=			median_of_a(lowerCamelCase__	, lowerCamelCase__	, start + ((end - start) // 2) + 1	, end - 1    )
								lowerCamelCase_						=			partition(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )
								intro_sort(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )
								lowerCamelCase_						=			p
				return insertion_sort(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )


if __name__ == "__main__":
			import doctest

			doctest.testmod()

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









from __future__ import annotations
def      _A       (		SCREAMING_SNAKE_CASE     :   list						):





  """simple docstring"""



  if len(SCREAMING_SNAKE_CASE						) == 0:
    return []
  a__					,							a__	:					int										=min(SCREAMING_SNAKE_CASE						), max(SCREAMING_SNAKE_CASE						)
  a__	:					Optional[int]										=int(max_value - min_value						) + 1
  a__	:					list[list]										=[[] for _ in range(SCREAMING_SNAKE_CASE						)]

  for i in my_list:
    buckets[int(i - min_value						)].append(SCREAMING_SNAKE_CASE						)

  return [v for bucket in buckets for v in sorted(SCREAMING_SNAKE_CASE						)]


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

     testmod()
     assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
     assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]






