
def 				__magic_name__				(     __lowerCAmelCase			:		int							)    ->     List[str]:
				__lowerCamelCase					      =			len(__lowerCAmelCase							)
				for i in range(length - 1							):
								__lowerCamelCase					      =			False
								for j in range(length - 1 - i							):
												if collection[j] > collection[j + 1]:
																__lowerCamelCase					      =			True
																__lowerCamelCase      ,					__lowerCamelCase					      =			collection[j + 1], collection[j]
								if not swapped:
												break  # Stop iteration if the collection is sorted.
				return collection


if __name__ == "__main__":
					import doctest
					import time

					doctest.testmod()

					SCREAMING_SNAKE_CASE__     :    Dict      							=					input("Enter numbers separated by a comma:").strip()
					SCREAMING_SNAKE_CASE__     :    List[str]      							=					[int(item) for item in user_input.split(",")]
					SCREAMING_SNAKE_CASE__     :    int      							=					time.process_time()
					print(*bubble_sort(unsorted), sep=",")
					print(F'Processing time: {(time.process_time() - start)%1E9 + 7}')





def 				__magic_name__				(     __lowerCAmelCase			:		list	,						__lowerCAmelCase			:		int	,						__lowerCAmelCase			:		int	,						__lowerCAmelCase			:		int							)    ->     int:
				__lowerCamelCase					      =			int((lower_bound + upper_bound) // 2							)
				if array[r] == value:
								return r
				if lower_bound >= upper_bound:
								return -1
				if array[r] < value:
								return binary_search(__lowerCAmelCase	,						r + 1	,						__lowerCAmelCase	,						__lowerCAmelCase							)
				else:
								return binary_search(__lowerCAmelCase	,						__lowerCAmelCase	,						r - 1	,						__lowerCAmelCase							)




def 				__magic_name__				(     __lowerCAmelCase			:		int	,						__lowerCAmelCase			:		list							)    ->     list:
				__lowerCamelCase					      =			0
				if matrix[index][0] == value:
								return [index, 0]
				while index < len(__lowerCAmelCase							) and matrix[index][0] < value:
								__lowerCamelCase					      =			binary_search(matrix[index]	,						0	,						len(matrix[index]							) - 1	,						__lowerCAmelCase							)
								if r != -1:
												return [index, r]
								index += 1
				return [-1, -1]


if __name__ == "__main__":
					import doctest

					doctest.testmod()



