

from __future__ import annotations

from random import choice
def 							__SCREAMING_SNAKE_CASE     (   a__    :   str       )					->				Optional[Any]:
	return choice(a__       )
def 							__SCREAMING_SNAKE_CASE     (   a__    :   list[int]			,a__    :   int       )					->				int:
	__A :			List[str]		    =			random_pivot(a__       )

	# partition based on pivot
	# linear time
	__A :			Optional[int]		    =			[e for e in lst if e < pivot]
	__A :			Tuple		    =			[e for e in lst if e > pivot]

	# if we get lucky, pivot might be the element we want.
	# we can easily see this:
	# small (elements smaller than k)
	# + pivot (kth element)
	# + big (elements larger than k)
	if len(a__       ) == k - 1:
		return pivot
	# pivot is in elements bigger than k
	elif len(a__       ) < k - 1:
		return kth_number(a__			,k - len(a__       ) - 1       )
	# pivot is in elements smaller than k
	else:
		return kth_number(a__			,a__       )


if __name__ == "__main__":
			import doctest

			doctest.testmod()













"""simple docstring"""



def 	SCREAMING_SNAKE_CASE__       (  snake_case       : Tuple				)->		str:






     '''simple docstring'''



     UpperCAmelCase__						:    List[str]							=							len(snake_case				)
     for i in range(length - 1				):
          UpperCAmelCase__						:    Any							=							i
          for k in range(i + 1			,					snake_case				):
               if collection[k] < collection[least]:
                    UpperCAmelCase__						:    Union[str, Any]							=							k
          if least != i:
               UpperCAmelCase__							,				UpperCAmelCase__						:    Union[str, Any]							=							(collection[i], collection[least])
     return collection


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


