





"""simple docstring"""

def        __a							(			A )       ->						list:



   '''simple docstring'''



   for i in range(len(_A ) - 1 ,	0 ,	-1 ):
      A__											=					False

      for j in range(_A ,	0 ,	-1 ):
         if unsorted[j] < unsorted[j - 1]:
            A__						,    A__											=					unsorted[j - 1], unsorted[j]
            A__											=					True

      for j in range(_A ):
         if unsorted[j] > unsorted[j + 1]:
            A__						,    A__											=					unsorted[j + 1], unsorted[j]
            A__											=					True

      if not swapped:
         break
   return unsorted


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 __UpperCAmelCase        =input("""Enter numbers separated by a comma:\n""").strip()
 __UpperCAmelCase        =[int(item) for item in user_input.split(""",""")]
 print(F'''{cocktail_shaker_sort(unsorted) = }''')



from __future__ import annotations

import numpy as np
def 							UpperCamelCase_(					_A :list[float]	)->		Optional[Any]:
			return np.maximum(0					,  _A	)


if __name__ == "__main__":
						print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]


