this is an implementation of bisection method for finding the optimum point minimum or maximum, using algorithm of bisection method, z= f(l) + f(R) / 2
minimum point of any derivative function that can be derivative once
The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method,
but it is also relatively slow. Because of this, it is often used to
obtain a rough approximation to a solution which is the