




'''simple docstring'''





from __future__ import annotations

import typing
from collections.abc import Iterable

import numpy as np

_SCREAMING_SNAKE_CASE							:   Dict      		= typing.Union[Iterable[float], Iterable[int], np.ndarray]  # noqa: UP007
_SCREAMING_SNAKE_CASE							:   Optional[Any]      		= typing.Union[np.floataa, int, float]  # noqa: UP007


def      UpperCamelCase_(	snake_case							:       Vector							,				snake_case							:       Vector     ):

							'''simple docstring'''






							return np.sqrt(np.sum((np.asarray(snake_case     ) - np.asarray(snake_case     )) ** 2     )     )


def      UpperCamelCase_(	snake_case							:       Vector							,				snake_case							:       Vector     ):

							'''simple docstring'''






							return sum((va - va) ** 2 for va, va in zip(snake_case							,				snake_case     )     ) ** (1 / 2)


if __name__ == "__main__":


		def      UpperCamelCase_(	):

									'''simple docstring'''






									from timeit import timeit

									print("Without Numpy"     )
									print(
									    timeit(
									        "euclidean_distance_no_np([1, 2, 3], [4, 5, 6])"							,				number=1_0_0_0_0							,				globals=globals()							,				)     )
									print("With Numpy"     )
									print(
									    timeit(
									        "euclidean_distance([1, 2, 3], [4, 5, 6])"							,				number=1_0_0_0_0							,				globals=globals()							,				)     )




		benchmark()












def __A    (      __lowerCAmelCase	)->  list:





						"""simple docstring"""



						if len(__lowerCAmelCase	) < 2:
												return collection

						def circle_sort_util(__lowerCAmelCase ,		__lowerCAmelCase ,		__lowerCAmelCase	) -> bool:
												_UpperCAmelCase									=			False

												if low == high:
																		return swapped

												_UpperCAmelCase									=			low
												_UpperCAmelCase									=			high

												while left < right:
																		if collection[left] > collection[right]:
																								_UpperCAmelCase					, _UpperCAmelCase									=			(
																								    collection[right],
																								    collection[left],
																								)
																								_UpperCAmelCase									=			True

																		left += 1
																		right -= 1

												if left == right and collection[left] > collection[right + 1]:
																		_UpperCAmelCase					, _UpperCAmelCase									=			(
																		    collection[right + 1],
																		    collection[left],
																		)

																		_UpperCAmelCase									=			True

												_UpperCAmelCase									=			low + int((high - low) / 2	)
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		__lowerCAmelCase ,		__lowerCAmelCase	)
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		mid + 1 ,		__lowerCAmelCase	)

												return swapped or left_swap or right_swap

						_UpperCAmelCase									=			True

						while is_not_sorted is True:
												_UpperCAmelCase									=			circle_sort_util(__lowerCAmelCase ,		0 ,		len(__lowerCAmelCase	) - 1	)

						return collection


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