👉 A bisection method is a root-finding algorithm used to find roots of a function. It consists of two steps:
1. Find the zero point, or local minimum, on the graph of the function.
2. Move the current guess (or "root") one unit in either direction and repeat step 1 until you reach a new zero.
The algorithm works by repeatedly selecting the midpoint between the current guess and the root as your new guess, with a probability that depends on how far
bisection