
'''simple docstring'''

from __future__ import annotations







def 	A  (   UpperCamelCase_       :  list[int | str]   )       ->							None:







			'''simple docstring'''



			create_state_space_tree(UpperCamelCase_    ,						[]    ,						0    ,						[0 for i in range(len(UpperCamelCase_   )   )]   )







def 	A  (   UpperCamelCase_       :  list[int | str]    ,						UpperCamelCase_       :  list[int | str]    ,						UpperCamelCase_       :  int    ,						UpperCamelCase_       :  list[int]    ,						)       ->							None:







			'''simple docstring'''



			if index == len(UpperCamelCase_   ):
						print(UpperCamelCase_   )
						return

			for i in range(len(UpperCamelCase_   )   ):
						if not index_used[i]:
									current_sequence.append(sequence[i]   )
									lowerCAmelCase__										=				True
									create_state_space_tree(UpperCamelCase_    ,						UpperCamelCase_    ,						index + 1    ,						UpperCamelCase_   )
									current_sequence.pop()
									lowerCAmelCase__										=				False
UpperCAmelCase__ :			list[int | str]											=		[3, 1, 2, 4]
generate_all_permutations(sequence)

UpperCAmelCase__ :			list[int | str]											=		["A", "B", "C"]



generate_all_permutations(sequence_a)










"""simple docstring"""






def      _lowercase							(    __snake_case      )		->  float:
			return 10 - x * x


def      _lowercase							(    __snake_case   ,__snake_case      )		->  float:
			# Bolzano theory in order to find if there is a root between a and b
			if equation(__snake_case      ) * equation(__snake_case      ) >= 0:
						raise ValueError("Wrong space!"      )

			__lowerCAmelCase :    List[Any]				=			a
			while (b - a) >= 0.01:
						# Find middle point
						__lowerCAmelCase :    str				=			(a + b) / 2
						# Check if middle point is root
						if equation(__snake_case      ) == 0.0:
									break
						# Decide the side to repeat the steps
						if equation(__snake_case      ) * equation(__snake_case      ) < 0:
									__lowerCAmelCase :    List[Any]				=			c
						else:
									__lowerCAmelCase :    List[str]				=			c
			return c


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	print(bisection(-2, 5))
	print(bisection(0, 6))