Anything related to a class of algorithms where the result is found by searching either the upper or the lower half of a sorted set of items and repeating this procedure recursively. Commonly used to refer to the bisection method (to find a root of an equation) or to the bisection search algorithm (to search a sorted list for a matching element).
Anything related to a class of algorithms where the result is found by searching either the upper or the lower half of a sorted set of items and repeating this procedure recursively, narrowing the search at each step.
Two common examples of bisection algorithms are:
- the bisection (or dichotomy) method used to find a root of an equation, or
- the bisection (or binary) search algorithm, used to search a sorted list for a matching element.
