


"""simple docstring"""



def 						__lowerCAmelCase		(		lowercase						:						str				)			->		int:


    """simple docstring"""





    stooge(lowercase		,							0		,							len(lowercase				) - 1				)
    return arr







def 						__lowerCAmelCase		(		lowercase						:						Dict		,							lowercase						:						Tuple		,							lowercase						:						List[Any]				)			->		List[Any]:


    """simple docstring"""





    if i >= h:
        return

    # If first element is smaller than the last then swap them
    if arr[i] > arr[h]:
        snake_case      ,snake_case					:   Tuple         =					arr[h], arr[i]

    # If there are more than 2 elements in the array
    if h - i + 1 > 2:
        snake_case					:   Optional[Any]         =					(int)((h - i + 1) / 3				)

        # Recursively sort first 2/3 elements
        stooge(lowercase		,							lowercase		,							(h - t)				)

        # Recursively sort last 2/3 elements
        stooge(lowercase		,							i + t		,							(lowercase)				)

        # Recursively sort first 2/3 elements
        stooge(lowercase		,							lowercase		,							(h - t)				)


if __name__ == "__main__":
  __snake_case         =					input("""Enter numbers separated by a comma:\n""").strip()
  __snake_case         =					[int(item) for item in user_input.split(""",""")]
  print(stooge_sort(unsorted))









"""simple docstring"""



from __future__ import annotations

from cmath import sqrt







def 						__lowerCAmelCase		(		lowercase						:						int		,							lowercase						:						int		,							lowercase						:						int				)			->		tuple[complex, complex]:


    """simple docstring"""





    if a == 0:
        raise ValueError("Coefficient 'a' must not be zero."				)
    snake_case					:   Dict         =					b * b - 4 * a * c

    snake_case					:   Tuple         =					(-b + sqrt(lowercase				)) / (2 * a)
    snake_case					:   Optional[int]         =					(-b - sqrt(lowercase				)) / (2 * a)

    return (
        root_a.real if not root_a.imag else root_a,
        root_a.real if not root_a.imag else root_a,
    )







def 						__lowerCAmelCase		(		)			->		List[Any]:


    """simple docstring"""





    snake_case      ,snake_case					:   Optional[Any]         =					quadratic_roots(a=5		,							b=6		,							c=1				)
    print(F'The solutions are: {solutiona} and {solutiona}'				)


if __name__ == "__main__":
  main()





