This algorithm of dichotomy is the simplest but also generically the slowest. It encloses the zero of a function on an interval. Each iteration cuts the interval into two parts, the middle point value is calculated. The function sign at this point gives you the half-interval on which the next iteration will be performed.
Example.
Input:
Output:
| ⎡ ⎣ | 0.739085133215 | ⎤ ⎦ |