




def       UpperCAmelCase__  (     lowerCamelCase   ):

  def merge(lowerCamelCase,			lowerCamelCase   ) -> list:

    def _merge():
      while left and right:
        yield (left if left[0] <= right[0] else right).pop(0   )
      yield from left
      yield from right

    return list(_merge()   )

  if len(lowerCamelCase   ) <= 1:
    return collection
  lowercase    :str      	=						len(lowerCamelCase   ) // 2
  return merge(merge_sort(collection[:mid]   ),			merge_sort(collection[mid:]   )   )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     _UpperCAmelCase	:						List[Any]			=     input("Enter numbers separated by a comma:\n").strip()
     _UpperCAmelCase	:						Optional[int]			=     [int(item) for item in user_input.split(",")]
     print(*merge_sort(unsorted), sep=",")









def       UpperCAmelCase__  (     lowerCamelCase   ):
  return 10 - x * x



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

  lowercase    :Optional[int]      	=						a
  while (b - a) >= 0.01:
    # Find middle point
    lowercase    :Optional[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:
      lowercase    :Any      	=						c
    else:
      lowercase    :List[Any]      	=						c
  return c


if __name__ == "__main__":
     import doctest

     doctest.testmod()

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



