


from __future__ import annotations







def        _lowerCamelCase(	lowercase__   , lowercase__	)						->	bool:

		'''simple docstring'''







		if len(lowercase__	) == 0:
				return False
		__lowercase=			len(lowercase__	) // 2
		if a_list[midpoint] == item:
				return True
		if item < a_list[midpoint]:
				return binary_search(a_list[:midpoint]   , lowercase__	)
		else:
				return binary_search(a_list[midpoint + 1 :]   , lowercase__	)


if __name__ == "__main__":
	lowerCAmelCase           =		input('''Enter numbers separated by comma:\n''').strip()
	lowerCAmelCase           =		[int(item.strip()) for item in user_input.split(''',''')]
	lowerCAmelCase           =		int(input('''Enter the number to be found in the list:\n''').strip())
	lowerCAmelCase           =		'''''' if binary_search(sequence, target) else '''not '''
	print(F'{target} was {not_str}found in {sequence}')










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))






