

"""simple docstring"""




def 					lowerCAmelCase  (   __UpperCamelCase ):
 '''simple docstring'''





 UpperCAmelCase__   :					Tuple   				=   [701, 301, 132, 57, 23, 10, 4, 1]
 for gap in gaps:
  for i in range(__UpperCamelCase							,      len(__UpperCamelCase ) ):
   UpperCAmelCase__   :					Dict   				=   collection[i]
   UpperCAmelCase__   :					List[Any]   				=   i
   while j >= gap and collection[j - gap] > insert_value:
    UpperCAmelCase__   :					int   				=   collection[j - gap]
    j -= gap
   if j != i:
    UpperCAmelCase__   :					Tuple   				=   insert_value
 return collection


if __name__ == "__main__":
      from doctest import testmod

      testmod()
      __UpperCAmelCase	=			input('Enter numbers separated by a comma:\n').strip()
      __UpperCAmelCase	=			[int(item) for item in user_input.split(',')]
      print(shell_sort(unsorted))








"""simple docstring"""




from __future__ import annotations
def 					lowerCAmelCase  (   __UpperCamelCase							,      __UpperCamelCase							,      __UpperCamelCase							,      __UpperCamelCase ):
 '''simple docstring'''





 UpperCAmelCase__				, UpperCAmelCase__   :					Optional[Any]   				=   m - 1, 0
 while i >= 0 and j < n:
  if key == mat[i][j]:
   print(F"Key {key} found at row- {i + 1} column- {j + 1}" )
   return
  if key < mat[i][j]:
   i -= 1
  else:
   j += 1
 print(F"Key {key} not found" )
def 					lowerCAmelCase  (   ):
 '''simple docstring'''





 UpperCAmelCase__   :					Union[str, Any]   				=   [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
 UpperCAmelCase__   :					int   				=   int(input("""Enter the element to be searched:""" ) )
 print(__UpperCamelCase )
 search_in_a_sorted_matrix(__UpperCamelCase							,      len(__UpperCamelCase )							,      len(mat[0] )							,      __UpperCamelCase )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()





