






def __A					(   __lowerCAmelCase			)->						Optional[int]:





						"""simple docstring"""



						_UpperCAmelCase             =    len(lowercase__			)
						for _ in range(
						    0				,	int(((no_of_elements - 1) / 2) + 1			)			):  # we don't need to traverse to end of list as
												for j in range(0				,	no_of_elements - 1			):
																		if (
																		    lst[j + 1] < lst[j]
																		):  # applying bubble sort algorithm from left to right (or forwards)
																								_UpperCAmelCase             =    lst[j + 1]
																								_UpperCAmelCase             =    lst[j]
																								_UpperCAmelCase             =    temp
																		if (
																		    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
																		):  # applying bubble sort algorithm from right to left (or backwards)
																								_UpperCAmelCase             =    lst[no_of_elements - 1 - j]
																								_UpperCAmelCase             =    lst[no_of_elements - 2 - j]
																								_UpperCAmelCase             =    temp
						return lst


if __name__ == "__main__":
		print('''enter the list to be sorted''')
		_a   			=						[int(x) for x in input().split()]  # inputing elements of the list in one line
		_a   			=						double_sort(lst)
		print('''the sorted list is''')
		print(sorted_lst)













import math
from timeit import timeit


def __A					(   __lowerCAmelCase			)->						int:





						"""simple docstring"""



						_UpperCAmelCase             =    0
						_UpperCAmelCase             =    abs(__lowerCAmelCase			)
						while True:
												_UpperCAmelCase             =    n // 10
												digits += 1
												if n == 0:
																		break
						return digits


def __A					(   __lowerCAmelCase			)->						int:





						"""simple docstring"""



						return 1 if n == 0 else math.floor(math.log(abs(__lowerCAmelCase			)				,	10			) + 1			)


def __A					(   __lowerCAmelCase			)->						int:





						"""simple docstring"""



						return len(str(abs(__lowerCAmelCase			)			)			)


def __A					(   )->						None:





						"""simple docstring"""



						from collections.abc import Callable

						def benchmark_a_function(__lowerCAmelCase				,	__lowerCAmelCase			) -> None:
												_UpperCAmelCase             =    F"""{func.__name__}({value})"""
												_UpperCAmelCase             =    timeit(F"""__main__.{call}"""				,	setup='import __main__'			)
												print(F"""{call}: {func(__lowerCAmelCase			)} -- {timing} seconds"""			)

						for value in (262_144, 1_125_899_906_842_624, 1_267_650_600_228_229_401_496_703_205_376):
												for func in (num_digits, num_digits_fast, num_digits_faster):
																		benchmark_a_function(__lowerCAmelCase				,	__lowerCAmelCase			)
												print()


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		benchmark()
