In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.
This program contains the iterative methods of finding solutions of the equation f(x)=0, which are also known as the roots of the equation f(x)=0
The methods are:
-bisection
-false position
-newton raphson
-secant
