






from __future__ import annotations

import math
from collections.abc import Callable





def       __lowerCAmelCase      (						__snake_case					, __snake_case					, __snake_case					, __snake_case = 100					, ):
					__lowerCAmelCase								=					x_start
					__lowerCAmelCase								=					fnc(__snake_case       )
					__lowerCAmelCase								=					0.0

					for _ in range(__snake_case       ):
										# Approximates curve as a sequence of linear lines and sums their length
										__lowerCAmelCase								=					(x_end - x_start) / steps + xa
										__lowerCAmelCase								=					fnc(__snake_case       )
										length += math.hypot(xa - xa					, fxa - fxa       )

										# Increment step
										__lowerCAmelCase								=					xa
										__lowerCAmelCase								=					fxa

					return length


if __name__ == "__main__":





	def       __lowerCAmelCase      (						__snake_case       ):
						return math.sin(10 * x       )

	print('''f(x) = sin(10 * x)''')
	print('''The length of the curve from x = -10 to x = 10 is:''')
	lowerCamelCase			:					Any         =	10
	while i <= 100000:
		print(F'''With {i} steps: {line_length(f, -10, 10, i)}''')
		i *= 10














def       __lowerCAmelCase      (						__snake_case       ):
     __lowerCAmelCase								=					len(__snake_case       )
     while cur > 1:
          # Find the maximum number in arr
          __lowerCAmelCase								=					arr.index(max(arr[0:cur]       )       )
          # Reverse from 0 to mi
          __lowerCAmelCase								=					arr[mi::-1] + arr[mi + 1 : len(__snake_case       )]
          # Reverse whole list
          __lowerCAmelCase								=					arr[cur - 1 :: -1] + arr[cur : len(__snake_case       )]
          cur -= 1
     return arr


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






