




def 					SCREAMING_SNAKE_CASE	(       __UpperCamelCase			:						list       ,     __UpperCamelCase			:						int      )  ->							int:
    for index, item in enumerate(__UpperCamelCase      ):
        if item == target:
            return index
    return -1




def 					SCREAMING_SNAKE_CASE	(       __UpperCamelCase			:						list       ,     __UpperCamelCase			:						int       ,     __UpperCamelCase			:						int       ,     __UpperCamelCase			:						int      )  ->							int:
    if not (0 <= high < len(__UpperCamelCase      ) and 0 <= low < len(__UpperCamelCase      )):
        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(__UpperCamelCase       ,     low + 1       ,     high - 1       ,     __UpperCamelCase      )


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

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











from __future__ import annotations




def 					SCREAMING_SNAKE_CASE	(       __UpperCamelCase			:						list[int | float]      )  ->							int | float:
    if len(__UpperCamelCase      ) == 0:
        raise ValueError('''find_max() arg is an empty sequence'''      )
    UpperCAmelCase_							 =     nums[0]
    for x in nums:
        if x > max_num:
            UpperCAmelCase_							 =     x
    return max_num


if __name__ == "__main__":
 import doctest

 doctest.testmod(verbose=True)





