
'''simple docstring'''






from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

UpperCAmelCase_       :   str   =       (3, 9, -11, 0, 7, 5, 1, -1)
UpperCAmelCase_       :   int   =       (4, 6, 2, 0, 8, 10, 3, -2)

@dataclass
class  UpperCAmelCase__						:
    lowerCAmelCase_				    =		42
    lowerCAmelCase_				    =		42


class  UpperCAmelCase__						:



    def __init__(	self      :       Optional[int],__A      :       Iterable[int]     ):
          _lowerCamelCase				:   Node | None								=   None
          for i in sorted(__A,reverse=__A     ):
                _lowerCamelCase				:   Dict								=   Node(__A,self.head     )



    def __iter__(	self      :       str     ):
          _lowerCamelCase				:   Dict								=   self.head
          while node:
                yield node.data
                _lowerCamelCase				:   Optional[Any]								=   node.next_node



    def __len__(	self      :       str     ):
          return sum(1 for _ in self     )



    def __str__(	self      :       str     ):
          return " -> ".join([str(__A     ) for node in self]     )







def 		A_       (	_lowerCAmelCase   :    SortedLinkedList				,	_lowerCAmelCase   :    SortedLinkedList							):



      """simple docstring"""




      return SortedLinkedList(list(_lowerCAmelCase							) + list(_lowerCAmelCase							)							)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 UpperCAmelCase_       :   List[str]   =       SortedLinkedList
 print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))



'''simple docstring'''






def 		A_       (	_lowerCAmelCase   :    float							):



      """simple docstring"""




      return 10 - x * x







def 		A_       (	_lowerCAmelCase   :    float				,	_lowerCAmelCase   :    float							):



      """simple docstring"""




      if equation(_lowerCAmelCase							) * equation(_lowerCAmelCase							) >= 0:
            raise ValueError("Wrong space!"							)

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


if __name__ == "__main__":
 import doctest

 doctest.testmod()

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