






def 				A	(			a_   )	->		list:
					__UpperCamelCase :   List[str]									=len(a_   )

					# Set the gap value to be decreased by a factor of 1.3
					# after each iteration
					__UpperCamelCase :   Union[str, Any]									=1.3

					# Continue sorting until the gap is 1
					while gap > 1:
										# Decrease the gap value
										__UpperCamelCase :   List[Any]									=int(gap / shrink   )

										# Sort the elements using insertion sort
										for i in range(a_				,len(a_   )   ):
															__UpperCamelCase :   List[str]									=collection[i]
															__UpperCamelCase :   Union[str, Any]									=i
															while j >= gap and collection[j - gap] > temp:
																				__UpperCamelCase :   List[str]									=collection[j - gap]
																				j -= gap
															__UpperCamelCase :   Union[str, Any]									=temp

					return collection


if __name__ == "__main__":
							import doctest

							doctest.testmod()









from __future__ import annotations






def 				A	(			a_				,a_   )	->		list[int]:
					__UpperCamelCase :   dict[int, int]									={}
					for index, val in enumerate(a_   ):
										__UpperCamelCase :   Union[str, Any]									=target - val
										if compl in chk_map:
															return [chk_map[compl], index]
										__UpperCamelCase :   List[Any]									=index
					return []


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							print(f"{two_sum([2, 7, 11, 15], 9) = }")

