Bisection Method - Pseudocode

Pseudocode

The method may be written in Pseudocode as follows:

INPUT: Function f, endpoint values a, b, tolerance TOL, maximum iterations NMAX CONDITIONS: a < b, either f(a) < 0 and f(b) > 0 or f(a) > 0 and f(b) < 0 OUTPUT: value which differs from a root of f(x)=0 by less than TOL N ← 1 While N ≤ NMAX { limit iterations to prevent infinite loop c ← (a + b)/2 new midpoint If (f(c) = 0 or (b – a)/2 < TOL then { solution found Output(c) Stop } N ← N + 1 increment step counter If sign(f(c)) = sign(f(a)) then a ← c else b ← c new interval } Output("Method failed.") max number of steps exceeded