
"""simple docstring"""
def     lowerCamelCase_    (	lowerCamelCase_ )     ->			tuple[int, int]:


					'''simple docstring'''
					# base case
					if len(lowerCamelCase_ ) == 1:
										return a[0], a[0]
					else:
										# split A into half.
										__a:						Tuple		    =					a[: len(lowerCamelCase_ ) // 2]
										__a:						List[Any]		    =					a[len(lowerCamelCase_ ) // 2 :]

										# 2 sub problems, 1/2 of original size.
										__a:						Optional[Any]		    =					max_difference(lowerCamelCase_ )
										__a:						List[Any]		    =					max_difference(lowerCamelCase_ )

										# get min of first and max of second
										# linear time
										__a:						Optional[int]		    =					min(lowerCamelCase_ )
										__a:						int		    =					max(lowerCamelCase_ )

										# 3 cases, either (small1, big1),
										# (min_first, max_second), (small2, big2)
										# constant comparisons
										if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
															return smalla, biga
										elif biga - smalla > max_second - min_first:
															return smalla, biga
										else:
															return min_first, max_second


if __name__ == "__main__":
							import doctest

							doctest.testmod()


"""simple docstring"""
def     lowerCamelCase_    (	lowerCamelCase_	,				lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					for index, item in enumerate(lowerCamelCase_ ):
										if item == target:
															return index
					return -1


def     lowerCamelCase_    (	lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					if not (0 <= high < len(lowerCamelCase_ ) and 0 <= low < len(lowerCamelCase_ )):
										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(lowerCamelCase_	,				low + 1	,				high - 1	,				lowerCamelCase_ )


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

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