




def  snake_case_					(		SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    )      ->			int:
							lowercase__  :	List[str]        =							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(SCREAMING_SNAKE_CASE_    ,r + 1    ,SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    )
							else:
														return binary_search(SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    ,r - 1    ,SCREAMING_SNAKE_CASE_    )
def  snake_case_					(		SCREAMING_SNAKE_CASE_    ,SCREAMING_SNAKE_CASE_    )      ->			list:
							lowercase__  :	List[Any]        =							0
							if matrix[index][0] == value:
														return [index, 0]
							while index < len(SCREAMING_SNAKE_CASE_    ) and matrix[index][0] < value:
														lowercase__  :	Optional[int]        =							binary_search(matrix[index]    ,0    ,len(matrix[index]    ) - 1    ,SCREAMING_SNAKE_CASE_    )
														if r != -1:
																					return [index, r]
														index += 1
							return [-1, -1]


if __name__ == "__main__":
						import doctest

						doctest.testmod()





def  snake_case_					(		SCREAMING_SNAKE_CASE_    )      ->			list:
							lowercase__  :	Optional[Any]        =							len(SCREAMING_SNAKE_CASE_    )

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

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

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

							return collection


if __name__ == "__main__":
						import doctest

						doctest.testmod()