


def 				UpperCamelCase__					(  SCREAMING_SNAKE_CASE__						):
 __lowerCamelCase		:							str		 =						len(SCREAMING_SNAKE_CASE__						)
 for i in range(length - 1						):
  __lowerCamelCase		:							Optional[int]		 =						i
  for k in range(i + 1      ,	SCREAMING_SNAKE_CASE__						):
   if collection[k] < collection[least]:
    __lowerCamelCase		:							Dict		 =						k
  if least != i:
   __lowerCamelCase ,					__lowerCamelCase		:							Optional[int]		 =						(collection[i], collection[least])
 return collection


if __name__ == "__main__":
       lowercase_	   =     input('Enter numbers separated by a comma:\n').strip()
       lowercase_	   =     [int(item) for item in user_input.split(',')]
       print(selection_sort(unsorted))





def 				UpperCamelCase__					(  SCREAMING_SNAKE_CASE__      ,	SCREAMING_SNAKE_CASE__						):
 __lowerCamelCase		:							Union[str, Any]		 =						len(SCREAMING_SNAKE_CASE__						)
 __lowerCamelCase		:							Any		 =						[[False] * (required_sum + 1) for _ in range(arr_len + 1						)]

 # for each arr value, a sum of zero(0) can be formed by not taking any element
 # hence True/1
 for i in range(arr_len + 1						):
  __lowerCamelCase		:							Dict		 =						True

 # sum is not zero and set is empty then false
 for i in range(1      ,	required_sum + 1						):
  __lowerCamelCase		:							Union[str, Any]		 =						False

 for i in range(1      ,	arr_len + 1						):
  for j in range(1      ,	required_sum + 1						):
   if arr[i - 1] > j:
    __lowerCamelCase		:							Tuple		 =						subset[i - 1][j]
   if arr[i - 1] <= j:
    __lowerCamelCase		:							List[Any]		 =						subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

 return subset[arr_len][required_sum]


if __name__ == "__main__":
       import doctest

       doctest.testmod()

