The bisection method is considered the simplest one-dimensional root-finding algorithm. The general interest is to find the value, x, of a continuous function, f, such that f(x)=0.
Suppose we know the two points of an interval, a and b, where a < b, and that f(a)<0 and f(b)>0 lie along the continuous function, taking the midpoint of this interval as c, where 
; the bisection method then evaluates this value as f(c).
Let's illustrate the setup of points along a nonlinear function with the following graph:
Since the value of ...
