
"""simple docstring"""
lowercase		:						int =					{0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

lowercase		:						Dict =					{0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}


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


					'''simple docstring'''
					__a:						Union[str, Any]		    =					True
					__a:						Dict		    =					[]

					for neighbour in graph[vert]:
										if not visited[neighbour]:
															connected_verts += dfs(lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_ )

					return [vert, *connected_verts]


def     lowerCamelCase_    (	lowerCamelCase_ )     ->			list:


					'''simple docstring'''
					__a:						str		    =					len(lowerCamelCase_ )
					__a:						Any		    =					graph_size * [False]
					__a:						List[Any]		    =					[]

					for i in range(lowerCamelCase_ ):
										if not visited[i]:
															__a:						Any		    =					dfs(lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_ )
															components_list.append(lowerCamelCase_ )

					return components_list


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}")
