
"""simple docstring"""





def       __a	(						__lowerCamelCase    ):
   UpperCAmelCase_   :   Dict     	=       len(__lowerCamelCase    )

   # Set the gap value to be decreased by a factor of 1.3
   # after each iteration
   UpperCAmelCase_   :   int     	=       1.3

   # Continue sorting until the gap is 1
   while gap > 1:
      # Decrease the gap value
      UpperCAmelCase_   :   Dict     	=       int(gap / shrink    )

      # Sort the elements using insertion sort
      for i in range(__lowerCamelCase,						len(__lowerCamelCase    )    ):
         UpperCAmelCase_   :   Optional[Any]     	=       collection[i]
         UpperCAmelCase_   :   Dict     	=       i
         while j >= gap and collection[j - gap] > temp:
            UpperCAmelCase_   :   Dict     	=       collection[j - gap]
            j -= gap
         UpperCAmelCase_   :   List[str]     	=       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) = }")

