KnowraBinary searchLinked fromLinked fromThe 13 pages that link to Binary search, each with the reason it gives.All 13Broader topic 7Related 6Bisection methodRelated: It shares interval halving, but searches ordered data rather than locating a zero of a continuous function.Geometric progressionRelated: Its shrinking search interval forms a geometric progression, explaining logarithmic running time.Binary search treeRelated: Both methods use ordering to discard candidates, but a tree stores the decisions in its shape.Binary treeRelated: Balanced binary search trees echo the repeated partitioning that makes this algorithm efficient.Red–black treeRelated: Its logarithmic search illustrates the benefit of keeping tree paths short.Akra–Bazzi methodRelated: Its recurrence is a simple special case with one recursive subproblem.