KnowraBinary searchLinked fromLinked fromThe 13 pages that link to Binary search, each with the reason it gives.All 13Broader topic 7Related 6AlgorithmBroader topic: It demonstrates how a problem’s structure can reduce the number of required steps.Big O notationBroader topic: Its logarithmic running time contrasts sharply with linear search.RecursionBroader topic: Its recursive form searches a smaller interval after each comparison.Time complexityBroader topic: Its logarithmic running time illustrates the benefit of reducing the search range by half.Analysis of algorithmsBroader topic: Its logarithmic search time exemplifies the effect of halving input size.Divide-and-conquer algorithmBroader topic: It reduces a problem to one smaller subproblem at each step.Master theoremBroader topic: Its recurrence has one half-sized recursive call and constant additional work.