Secant method Algorithm

In numerical analysis, the secant method is a root-finding algorithm that uses a succession of beginnings of secant lines to better estimate a root of a function f. However, the method was developed independently of Newton's method and predates it by over 3000 years.

Secant method source code, pseudocode and analysis