secant Method for finding roots of an equation algorithm in C++

I got question letter again from University of Minnesota.. of my GOD. topic of this time is secant method.. sucks calculus.. but inteserting for me.. btw I get A grade in Linear Algebra, Discrete Mathematics, Probability and Statistics, Numerical Methods.. so not hard for me.. ckckckck ^.^

for my bro.. I give the answer script in the end. you can download that..

The Secant Method for finding roots of an equation f(x)=0 eliminates the need to compute the derivative of the function f(x). this method computes the (i+1)st approximation , X(i+1), to the root of the equation f(x) = 0 in terms of the ith approximation, Xi , and the by the (i-1)st approximation, X(i-1), using the formula :