
def 						_snake_case(  SCREAMING_SNAKE_CASE__    )			->   Any:
       lowercase							:					List[str]	     =				len(UpperCAmelCase__    )
       while cur > 1:
              # Find the maximum number in arr
              lowercase							:					Tuple	     =				arr.index(max(arr[0:cur]    )    )
              # Reverse from 0 to mi
              lowercase							:					Optional[int]	     =				arr[mi::-1] + arr[mi + 1 : len(UpperCAmelCase__    )]
              # Reverse whole list
              lowercase							:					Optional[int]	     =				arr[cur - 1 :: -1] + arr[cur : len(UpperCAmelCase__    )]
              cur -= 1
       return arr


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


from collections.abc import Callable

import numpy as np







def 						_snake_case(  SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__    )			->   np.array:
       lowercase							:					Optional[int]	     =				int(np.ceil((x_end - xa) / step_size    )    )
       lowercase							:					List[Any]	     =				np.zeros((n + 1,)    )
       lowercase							:					Optional[int]	     =				ya
       lowercase							:					Optional[int]	     =				xa

       for k in range(SCREAMING_SNAKE_CASE__    ):
              lowercase							:					str	     =				y[k] + step_size * ode_func(SCREAMING_SNAKE_CASE__ ,     y[k]    )
              lowercase							:					Union[str, Any]	     =				y[k] + (
                  (step_size / 2) * (ode_func(SCREAMING_SNAKE_CASE__ ,     y[k]    ) + ode_func(x + step_size ,     SCREAMING_SNAKE_CASE__    ))
              )
              x += step_size

       return y


if __name__ == "__main__":
  import doctest

  doctest.testmod()
