rewrite the recursive bisection root finding


Rewrite the recursive bisection root finding function from lecture to be iterative (using a while loop). The function declaration should be root = bisectIter(f,a,b,tol). The inputs to the function are:

  •  f a handle to the function
  • ? a the left endpoint of the interval
  • ? b the right endpoint of the interval
  • ? tol the tolerance to nd the root within

The output of the function root is a root of the function satisfying abs(root-r)

Request for Solution File

Ask an Expert for Answer!!
C/C++ Programming: rewrite the recursive bisection root finding
Reference No:- TGS0276619

Expected delivery within 24 Hours