# Algorithm for Bisection method

A continuous function f(x) such that f(a) and f(b) have opposite signs, must have a zero (a point x such that f(x) = 0) in the interval [a, b].

Give a pseudocode for the bisection method algorithm Bise(f(x),a,b,error) for finding an approximation to a zero of a continuous function f(x) in the interval [a, b] accurate to within error.

© BrainMass Inc. brainmass.com October 9, 2019, 8:02 pm ad1c9bdddfhttps://brainmass.com/computer-science/approximation-algorithm/algorithm-bisection-method-137103

#### Solution Preview

By checking whether f(a) and f((a+b)/2) have opposite signs, we can determine whether a zero occurs in the subinterval [a, (a+b)/2] or in the subinterval [(a+b)/2, b]. The bisection method ...

#### Solution Summary

The solution briefly explains the working of bisection method before giving the algorithm pseudocode.

$2.19