If you are trying to understand Bisection Method: its algorithm, flowchart and code in C. You are at right place we’ll be discussing how bisection method works and implement it in a C Program. First of all, let’s understand what is Bisection Method. The *bisection method* is one of the simplest and most reliable of iterative methods for the solution of nonlinear equations. This method, also known as *binary chopping* or *half-interval* method, relies on the fact that if *f(x)* is real and continuous in the interval *a < x < b*, and *f(a)* and *f(b)* are of opposite signs, that is,

*f(a)*f(b) < 0*

then there is at least one real root in the interval between a and b.