


def   snake_case_    (			__lowercase      ,							__lowercase							):
   for index, item in enumerate(__lowercase							):
      if item == target:
         return index
   return -1
def   snake_case_    (			__lowercase      ,							__lowercase      ,							__lowercase      ,							__lowercase							):
   if not (0 <= high < len(__lowercase							) and 0 <= low < len(__lowercase							)):
      raise Exception('''Invalid upper or lower bound!'''							)
   if high < low:
      return -1
   if sequence[low] == target:
      return low
   if sequence[high] == target:
      return high
   return rec_linear_search(__lowercase      ,							low + 1      ,							high - 1      ,							__lowercase							)


if __name__ == "__main__":
       __UpperCamelCase					:	Optional[int]          =				input('Enter numbers separated by comma:\n').strip()
       __UpperCamelCase					:	Optional[int]          =				[int(item.strip()) for item in user_input.split(',')]

       __UpperCamelCase					:	Union[str, Any]          =				int(input('Enter a single number to be found in the list:\n').strip())
       __UpperCamelCase					:	Any          =				linear_search(sequence, target)
       if result != -1:
              print(F'linear_search({sequence}, {target}) = {result}')
       else:
              print(F'{target} was not found in {sequence}')



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


if __name__ == "__main__":
       import doctest

       doctest.testmod()