


'''simple docstring'''



from __future__ import annotations


def 				lowerCamelCase__				(	A       :      list[int | float]				,       A       :      int				,       A       :      int					):




						'''simple docstring'''






						if len(A					) == 0:
												raise ValueError('''find_max() arg is an empty sequence'''					)
						if (
						    left >= len(A					)
						    or left < -len(A					)
						    or right >= len(A					)
						    or right < -len(A					)
						):
												raise IndexError('''list index out of range'''					)
						if left == right:
												return nums[left]
						UpperCAmelCase					    =     (left + right) >> 1  # the middle
						UpperCAmelCase					    =     find_max(A				,       A				,       A					)  # find max in range[left, mid]
						UpperCAmelCase					    =     find_max(A				,       mid + 1				,       A					)  # find max in range[mid + 1, right]

						return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
	import doctest

	doctest.testmod(verbose=True)









'''simple docstring'''



def 				lowerCamelCase__				(	A       :      int				,       A       :      int					):




						'''simple docstring'''






						return int(input_a == input_a == 0					)


def 				lowerCamelCase__				(	):




						'''simple docstring'''






						print('''Truth Table of NOR Gate:'''					)
						print('''|   Input 1   |  Input 2  | Output |'''					)
						print(f"""|      0      |    0      |  {nor_gate(0				,       0					)}     |"""					)
						print(f"""|      0      |    1      |  {nor_gate(0				,       1					)}     |"""					)
						print(f"""|      1      |    0      |  {nor_gate(1				,       0					)}     |"""					)
						print(f"""|      1      |    1      |  {nor_gate(1				,       1					)}     |"""					)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	main()





