Basically the idea is the same, halve the set of possible solutions at each step.junbin wrote:Am I right to say that bisection method means binary search?
ie: You "guess" an answer, determine if the correct answer should be higher or lower, then guess a number that is closer and you keep guessing until you guessed the correct answer?
The term binary search is appropriate when applied to a finite(?) set of discrete values, while bisection is used when you have a continuous range of values.
Of course bisection doesn't find a solution, but restricts the interval of values at the point that it is smaller than a chosen approximation, it doesn't actually find the solution...