



from __future__ import annotations

# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
UpperCAmelCase      :							int							       =10



def       _lowerCAmelCase			(_lowerCAmelCase      ,		_lowerCAmelCase      ,		_lowerCAmelCase      ,		_lowerCAmelCase):
					for i in range(__UpperCAmelCase      ,		__UpperCAmelCase):
										if array[i] == target:
															return i
					return -1



def       _lowerCAmelCase			(_lowerCAmelCase      ,		_lowerCAmelCase):
					UpperCamelCase_						     =      0
					UpperCamelCase_						     =      len(__UpperCAmelCase)
					while left <= right:
										if right - left < precision:
															return lin_search(__UpperCAmelCase      ,		__UpperCAmelCase      ,		__UpperCAmelCase      ,		__UpperCAmelCase)

										UpperCamelCase_						     =      (left + right) // 3 + 1
										UpperCamelCase_						     =      2 * (left + right) // 3 + 1

										if array[one_third] == target:
															return one_third
										elif array[two_third] == target:
															return two_third

										elif target < array[one_third]:
															UpperCamelCase_						     =      one_third - 1
										elif array[two_third] < target:
															UpperCamelCase_						     =      two_third + 1

										else:
															UpperCamelCase_						     =      one_third + 1
															UpperCamelCase_						     =      two_third - 1
					else:
										return -1



def       _lowerCAmelCase			(_lowerCAmelCase      ,		_lowerCAmelCase      ,		_lowerCAmelCase      ,		_lowerCAmelCase):
					if left < right:
										if right - left < precision:
															return lin_search(__UpperCAmelCase      ,		__UpperCAmelCase      ,		__UpperCAmelCase      ,		__UpperCAmelCase)
										UpperCamelCase_						     =      (left + right) // 3 + 1
										UpperCamelCase_						     =      2 * (left + right) // 3 + 1

										if array[one_third] == target:
															return one_third
										elif array[two_third] == target:
															return two_third

										elif target < array[one_third]:
															return rec_ternary_search(__UpperCAmelCase      ,		one_third - 1      ,		__UpperCAmelCase      ,		__UpperCAmelCase)
										elif array[two_third] < target:
															return rec_ternary_search(two_third + 1      ,		__UpperCAmelCase      ,		__UpperCAmelCase      ,		__UpperCAmelCase)
										else:
															return rec_ternary_search(one_third + 1      ,		two_third - 1      ,		__UpperCAmelCase      ,		__UpperCAmelCase)
					else:
										return -1


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	UpperCAmelCase      :							str							       =input("""Enter numbers separated by comma:\n""").strip()
	UpperCAmelCase      :							str							       =[int(item.strip()) for item in user_input.split(""",""")]
	assert collection == sorted(collection), F"List must be ordered.\n{collection}."
	UpperCAmelCase      :							int							       =int(input("""Enter the number to be found in the list:\n""").strip())
	UpperCAmelCase      :							Any							       =ite_ternary_search(collection, target)
	UpperCAmelCase      :							List[Any]							       =rec_ternary_search(0, len(collection) - 1, collection, target)
	if resulta != -1:
		print(F"Iterative search: {target} found at positions: {resulta}")
		print(F"Recursive search: {target} found at positions: {resulta}")
	else:
		print("""Not found""")

"""simple docstring"""






from __future__ import annotations

from math import pi, sqrt



def SCREAMING_SNAKE_CASE__			(   __UpperCAmelCase       ,    __UpperCAmelCase )  ->  tuple:

   if inductance <= 0:
      raise ValueError('''Inductance cannot be 0 or negative''' )

   elif capacitance <= 0:
      raise ValueError('''Capacitance cannot be 0 or negative''' )

   else:
      return (
          "Resonant frequency",
          float(1 / (2 * pi * (sqrt(inductance * capacitance ))) ),
      )


if __name__ == "__main__":
       import doctest

       doctest.testmod()
