

def       __snake_case						( __UpperCamelCase	: List[Any]    ):



      """simple docstring"""

      if collection == []:
            return []

      # get some information about the collection
      A_						  =				len(__UpperCamelCase    )
      A_						  =				max(__UpperCamelCase    )
      A_						  =				min(__UpperCamelCase    )

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

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

      return ordered

def       __snake_case						( __UpperCamelCase	: Optional[int]    ):



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

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





'''simple docstring'''



def       _UpperCamelCase			(_lowerCamelCase				:  int ,						_lowerCamelCase				:  int ,						_lowerCamelCase				:  int						)-> float:




     '''simple docstring'''





     __snake_case            =	(num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
     # formula for sum of series
     return total







def       _UpperCamelCase			()-> str:




     '''simple docstring'''





     print(sum_of_series(1 ,						1 ,						10						)						)


if __name__ == "__main__":
     import doctest

     doctest.testmod()






