
'''simple docstring'''





def 	snake_case_							(				_a  :				list			,       _a  :				int			,       _a  :				int      ):
      if right <= left:
            return
      snake_case_    							=				snake_case_    							=				left
      snake_case_    							=				right
      snake_case_    							=				sorting[left]
      while i <= b:
            if sorting[i] < pivot:
                  snake_case_							,						snake_case_    							=				sorting[i], sorting[a]
                  a += 1
                  i += 1
            elif sorting[i] > pivot:
                  snake_case_							,						snake_case_    							=				sorting[i], sorting[b]
                  b -= 1
            else:
                  i += 1
      quick_sort_apartition(_a			,       _a			,       a - 1      )
      quick_sort_apartition(_a			,       b + 1			,       _a      )
def 	snake_case_							(				_a  :				list			,       _a  :				int			,       _a  :				int      ):
      if left < right:
            snake_case_    							=				lomuto_partition(_a			,       _a			,       _a      )
            quick_sort_lomuto_partition(_a			,       _a			,       pivot_index - 1      )
            quick_sort_lomuto_partition(_a			,       pivot_index + 1			,       _a      )
def 	snake_case_							(				_a  :				list			,       _a  :				int			,       _a  :				int      ):
      snake_case_    							=				sorting[right]
      snake_case_    							=				left
      for i in range(_a			,       _a      ):
            if sorting[i] < pivot:
                  snake_case_							,						snake_case_    							=				sorting[i], sorting[store_index]
                  store_index += 1
      snake_case_							,						snake_case_    							=				sorting[store_index], sorting[right]
      return store_index
def 	snake_case_							(				_a  :				list      ):
      if len(_a      ) <= 1:
            return sorting
      return (
          three_way_radix_quicksort([i for i in sorting if i < sorting[0]]      )
          + [i for i in sorting if i == sorting[0]]
          + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]      )
      )


if __name__ == "__main__":
     import doctest

     doctest.testmod(verbose=True)

     A							     = input("Enter numbers separated by a comma:\n").strip()
     A							     = [int(item) for item in user_input.split(",")]
     quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
     print(unsorted)





def 		snake_case_   (				lowercase__     :    str     ):






				'''simple docstring'''






				_lowerCAmelCase  						=53_81
				for x in s:
								_lowerCAmelCase  						=((hash_value << 5) + hash_value) + ord(lowercase__     )
				return hash_value & 0Xffff_ffff

