




"""simple docstring"""






import numpy as np







def      _snake_case			(				lowercase__							,    lowercase__							,    lowercase__							,    lowercase__							,    lowercase__		):
				_lowerCamelCase     :			List[str]    =    int(np.ceil((x_end - xa) / h		)		)
				_lowerCamelCase     :			Any    =    np.zeros((n + 1,)		)
				_lowerCamelCase     :			Optional[int]    =    ya
				_lowerCamelCase     :			Dict    =    xa

				for k in range(lowercase__		):
								_lowerCamelCase     :			Any    =    f(lowercase__							,    y[k]		)
								_lowerCamelCase     :			str    =    f(x + 0.5 * h							,    y[k] + 0.5 * h * ka		)
								_lowerCamelCase     :			Tuple    =    f(x + 0.5 * h							,    y[k] + 0.5 * h * ka		)
								_lowerCamelCase     :			Optional[Any]    =    f(x + h							,    y[k] + h * ka		)
								_lowerCamelCase     :			Tuple    =    y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
								x += h

				return y


if __name__ == "__main__":
			import doctest

			doctest.testmod()



def        _lowerCamelCase(	lowercase__	)						->	int:

		'''simple docstring'''







		if collection == []:
				return []

		# get some information about the collection
		__lowercase=			len(lowercase__	)
		__lowercase=			max(lowercase__	)
		__lowercase=			min(lowercase__	)

		# create the counting array
		__lowercase=			coll_max + 1 - coll_min
		__lowercase=			[0] * counting_arr_length

		# count how much a number appears in the collection
		for number in collection:
				counting_arr[number - coll_min] += 1

		# sum each position with it's predecessors. now, counting_arr[i] tells
		# us how many elements <= i has in the collection
		for i in range(1   , lowercase__	):
				__lowercase=			counting_arr[i] + counting_arr[i - 1]

		# create the output collection
		__lowercase=			[0] * coll_len

		# place the elements in the output, respecting the original order (stable
		# sort) from end to begin, updating counting_arr
		for i in reversed(range(0   , lowercase__	)	):
				__lowercase=			collection[i]
				counting_arr[collection[i] - coll_min] -= 1

		return ordered







def        _lowerCamelCase(	lowercase__	)						->	List[str]:

		'''simple docstring'''







		return "".join([chr(lowercase__	) for i in counting_sort([ord(lowercase__	) for c in string]	)]	)


if __name__ == "__main__":
	# Test string sort
	assert counting_sort_string('''thisisthestring''') == "eghhiiinrsssttt"

	lowerCAmelCase           =		input('''Enter numbers separated by a comma:\n''').strip()
	lowerCAmelCase           =		[int(item) for item in user_input.split(''',''')]
	print(counting_sort(unsorted))






