





'''simple docstring'''
from __future__ import annotations
def 				lowercase__   (   __lowercase						:  list[int | str]     ) ->      None:



       """simple docstring"""






       create_state_space_tree(__lowercase				,  []				,  0				,  [0 for i in range(len(__lowercase     )     )]     )
def 				lowercase__   (   __lowercase						:  list[int | str]				,  __lowercase						:  list[int | str]				,  __lowercase						:  int				,  __lowercase						:  list[int]				,  ) ->      None:



       """simple docstring"""






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

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

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


generate_all_permutations(sequence_a)


def     __lowerCAmelCase			(			a__						,    a__						,    a__  )       ->  list:
				__a										=    len(a__  )
				__a										=    [[0] * n for i in range(a__  )]
				for i in range(a__  ):
								__a										=    y_points[i]

				for i in range(2						,    a__  ):
								for j in range(a__						,    a__  ):
												__a										=    (
												    (xa - x_points[j - i + 1]) * q[j][i - 1]
												    - (xa - x_points[j]) * q[j - 1][i - 1]
												) / (x_points[j] - x_points[j - i + 1])

				return [q[n - 1][n - 1], q]


if __name__ == "__main__":
					import doctest

					doctest.testmod()