





def   lowerCamelCase__       (       UpperCamelCase__     :    Any  )     ->	Dict:



					'''simple docstring'''




					if collection == []:
										return []

					# get some information about the collection
					_snake_case													=			len(UpperCamelCase__  )
					_snake_case													=			max(UpperCamelCase__  )
					_snake_case													=			min(UpperCamelCase__  )

					# create the counting array
					_snake_case													=			coll_max + 1 - coll_min
					_snake_case													=			[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    ,      UpperCamelCase__  ):
										_snake_case													=			counting_arr[i] + counting_arr[i - 1]

					# create the output collection
					_snake_case													=			[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    ,      UpperCamelCase__  )  ):
										_snake_case													=			collection[i]
										counting_arr[collection[i] - coll_min] -= 1

					return ordered





def   lowerCamelCase__       (       UpperCamelCase__     :    Dict  )     ->	List[str]:



					'''simple docstring'''




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


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

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










def   lowerCamelCase__       (       UpperCamelCase__     :    Tuple    ,      UpperCamelCase__     :    Optional[int]  )     ->	Tuple:



					'''simple docstring'''




					_snake_case													=			[0 for i in range(r + 1  )]
					# nc0 = 1
					_snake_case													=			1
					for i in range(1    ,      n + 1  ):
										# to compute current row from previous row.
										_snake_case													=			min(UpperCamelCase__    ,      UpperCamelCase__  )
										while j > 0:
															c[j] += c[j - 1]
															j -= 1
					return c[r]




print(binomial_coefficient(n=10, r=5))



